On bidding for a fixed number of items in a sequence of auctions

DOI10.1016/J.EJOR.2012.03.050zbMath1253.91081OpenAlexW2126623591WikidataQ56094652 ScholiaQ56094652MaRDI QIDQ1926913

Michael N. Katehakis, Kartikeya S. Puranam

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.050

zbMATH Keywords

dynamic programmingMarkov decision processesstochastic processesauctions/bidding

Mathematics Subject Classification ID

Production theory, theory of the firm (91B38) Dynamic programming (90C39) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov and semi-Markov decision processes (90C40) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (6)

A sequential procurement model for a PPP project pipeline ⋮ Optimal bidding in auctions from a game theory perspective ⋮ On the evaluation of bidding strategies in sequential auctions ⋮ On optimal bidding and inventory control in sequential procurement auctions: the multi period case ⋮ Behavioral models for first-price sealed-bid auctions with the one-shot decision theory ⋮ Competing trade mechanisms and monotone mechanism choice

Cites Work

• Dynamic lot-sizing in sequential online retail auctions
• Declining prices in sequential auctions with complete revelation of bids
• Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations
• Sequential auctions of stochastically equivalent objects
• Optimal adaptive policies for sequential allocation problems
• Optimal Dynamic Auctions for Revenue Management
• Optimal Bidding in Sequential Auctions
• Optimal Adaptive Policies for Markov Decision Processes

This page was built for publication: On bidding for a fixed number of items in a sequence of auctions