Advanced Search
MyIDEAS: Login to save this article or follow this journal

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

Contents:

Author Info

  • Katehakis, Michael N.
  • Puranam, Kartikeya S.
Registered author(s):

    Abstract

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712002767
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 222 (2012)
    Issue (Month): 1 ()
    Pages: 76-84

    as in new window
    Handle: RePEc:eee:ejores:v:222:y:2012:i:1:p:76-84

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords: Stochastic processes; Dynamic programming; Markov Decision Processes; Auctions/bidding;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000111, David K. Levine.
    2. Engelbrecht-Wiggans, Richard, 1994. "Sequential auctions of stochastically equivalent objects," Economics Letters, Elsevier, vol. 44(1-2), pages 87-90.
    3. Chen, Xi & Ghate, Archis & Tripathi, Arvind, 2011. "Dynamic lot-sizing in sequential online retail auctions," European Journal of Operational Research, Elsevier, vol. 215(1), pages 257-267, November.
    4. Milgrom, Paul, 1989. "Auctions and Bidding: A Primer," Journal of Economic Perspectives, American Economic Association, vol. 3(3), pages 3-22, Summer.
    5. Paul Klemperer, 1999. "Auction Theory: A Guide to the Literature," Microeconomics 9903002, EconWPA.
    6. Richard Engelbrecht-Wiggans, 1980. "State of the Art---Auctions and Bidding Models: A Survey," Management Science, INFORMS, vol. 26(2), pages 119-142, February.
    7. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 7-11.
    8. John M. Crespi & Richard J. Sexton, 2004. "Bidding for Cattle in the Texas Panhandle," American Journal of Agricultural Economics, Agricultural and Applied Economics Association, vol. 86(3), pages 660-674.
    9. Edieal J. Pinker & Abraham Seidmann & Yaniv Vakrat, 2003. "Managing Online Auctions: Current Business and Research Issues," Management Science, INFORMS, vol. 49(11), pages 1457-1484, November.
    10. Pinker, Edieal & Seidmann, Abraham & Vakrat, Yaniv, 2010. "Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations," European Journal of Operational Research, Elsevier, vol. 202(2), pages 574-583, April.
    11. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    12. von der Fehr, Nils-Henrik Morch, 1994. "Predatory Bidding in Sequential Auctions," Oxford Economic Papers, Oxford University Press, vol. 46(3), pages 345-56, July.
    13. Kannan, Karthik N., 2010. "Declining prices in sequential auctions with complete revelation of bids," Economics Letters, Elsevier, vol. 108(1), pages 49-51, July.
    14. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Jiang, Zhong-Zhong & Fang, Shu-Cherng & Fan, Zhi-Ping & Wang, Dingwei, 2013. "Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers," European Journal of Operational Research, Elsevier, vol. 226(1), pages 139-153.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:222:y:2012:i:1:p:76-84. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.