Logo image
On bidding for a fixed number of items in a sequence of auctions
Journal article   Open access   Peer reviewed

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

Michael N. Katehakis and Kartikeya S. Puranam
European journal of operational research, Vol.222(1), pp.76-84
10/01/2012

Abstract

Auctions/bidding Dynamic programming Markov Decision Processes Stochastic processes
► Buyer acquires a fixed number of items by participating in a sequence of auctions. ► Item can also be bought outright at a high fixed price. ► Objective is to minimize the total expected cost. ► Markov Decision Process is used to model the problem. ► Monotonicity properties of the optimal bid are established. We consider the problem of a firm (“the buyer”) that must acquire a fixed number (L) of items. The buyer can acquire these items either at a fixed buy-it-now price in the open market or by participating in a sequence of N>L auctions. The objective of the buyer is to minimize his expected total cost for acquiring all L items. We model this problem as a Markov Decision Process and establish monotonicity properties for the optimal value function and the optimal bidding strategies.
pdf
bidding-EJOR714.63 kBDownloadView
Accepted Manuscript (AM) European Journal of Operational Research Open Access
url
https://doi.org/10.1016/j.ejor.2012.03.050View
Version of Record (VoR) European Journal of Operational Research
url
Report an accessibility issueView
Please complete a content remediation request to report an accessibility issue with a library electronic resource, website, or service.

Metrics

14 File downloads
16 Record Views

Details

Logo image