IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v43y2014i4p791-819.html
   My bibliography  Save this article

Efficiency levels in sequential auctions with dynamic arrivals

Author

Listed:
  • Ron Lavi
  • Ella Segev

Abstract

In an environment with dynamic arrivals of players who wish to purchase only one of multiple identical objects for which they have a private value, we analyze a sequential auction mechanism with an activity rule. If the players play undominated strategies then we are able to bound the efficiency loss compared to an optimal mechanism that maximizes the total welfare. We have no assumptions on the underlying distribution from which the players’ arrival times and valuations for the object are drawn. Moreover we have no assumption of a common prior on this distribution. Copyright Springer-Verlag Berlin Heidelberg 2014

Suggested Citation

  • Ron Lavi & Ella Segev, 2014. "Efficiency levels in sequential auctions with dynamic arrivals," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 791-819, November.
    • Handle: RePEc:spr:jogath:v:43:y:2014:i:4:p:791-819
    DOI: 10.1007/s00182-013-0405-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-013-0405-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00182-013-0405-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    2. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    3. Dirk Bergemann & Juuso V‰lim‰ki, 2010. "The Dynamic Pivot Mechanism," Econometrica, Econometric Society, vol. 78(2), pages 771-789, March.
    4. Paul Klemperer (ed.), 2000. "The Economic Theory of Auctions," Books, Edward Elgar Publishing, volume 0, number 1669.
    5. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    6. Ye, Lixin, 2007. "Indicative bidding and a theory of two-stage auctions," Games and Economic Behavior, Elsevier, vol. 58(1), pages 181-207, January.
    7. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    8. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    9. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    10. Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. R. Preston McAfee, 2002. "Coarse Matching," Econometrica, Econometric Society, vol. 70(5), pages 2025-2034, September.
    12. Neeman, Zvika, 2003. "The effectiveness of English auctions," Games and Economic Behavior, Elsevier, vol. 43(2), pages 214-238, May.
    13. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    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


    Cited by:

    1. Patrick Hummel, 2018. "Reserve prices in repeated auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 273-299, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    2. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
    3. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
    4. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    6. Hamid Nazerzadeh & Amin Saberi & Rakesh Vohra, 2013. "Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising," Operations Research, INFORMS, vol. 61(1), pages 98-111, February.
    7. Alex Gershkov & Benny Moldovanu & Philipp Strack, 2018. "Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand," Management Science, INFORMS, vol. 64(5), pages 2031-2046, May.
    8. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    9. Hinnosaar, Toomas, 2017. "Calendar mechanisms," Games and Economic Behavior, Elsevier, vol. 104(C), pages 252-270.
    10. Yiwei Chen & Vivek F. Farias, 2018. "Robust Dynamic Pricing with Strategic Customers," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1119-1142, November.
    11. Liu, Heng, 2018. "Efficient dynamic mechanisms in environments with interdependent valuations: the role of contingent transfers," Theoretical Economics, Econometric Society, vol. 13(2), May.
    12. Vahab Mirrokni & Renato Paes Leme & Pingzhong Tang & Song Zuo, 2020. "Non‐Clairvoyant Dynamic Mechanism Design," Econometrica, Econometric Society, vol. 88(5), pages 1939-1963, September.
    13. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.
    14. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    15. Daley, Brendan & Schwarz, Michael & Sonin, Konstantin, 2012. "Efficient investment in a dynamic auction environment," Games and Economic Behavior, Elsevier, vol. 75(1), pages 104-119.
    16. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    17. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
    18. Aristotelis Boukouras & Kostas Koufopoulos, 2017. "Efficient allocations in economies with asymmetric information when the realized frequency of types is common knowledge," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(1), pages 75-98, June.
    19. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    20. Thomas D. Jeitschko & Pallavi Pal, 2021. "Curbing Price Fluctuations in Cap-and-Trade Auctions," CESifo Working Paper Series 9266, CESifo.

    More about this item

    Keywords

    Sequential ascending auctions; Undominated strategies ; Dynamic arrivals; C72;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:43:y:2014:i:4:p:791-819. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.