Skip to main content

Sequential Bidding in the Bailey-Cavallo Mechanism

  • Conference paper
Book cover Internet and Network Economics (WINE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5929))

Included in the following conference series:

  • 2373 Accesses

Abstract

We are interested in mechanisms that maximize social welfare. In [2] this problem was studied for multi-unit auctions and for public project problems, and in each case social welfare undominated mechanisms were identified. One way to improve upon these optimality results is by allowing the players to move sequentially. With this in mind, we study here a sequential version of the Bailey-Cavallo mechanism, a natural mechanism that was proved to be welfare undominated in the simultaneous setting by [2]. Because of the absence of dominant strategies in the sequential setting, we focus on a weaker concept of an optimal strategy. We proceed by introducing natural optimal strategies and show that among all optimal strategies, the one we introduce generates maximal social welfare. Finally, we show that the proposed strategies form a safety level equilibrium and within the class of optimal strategies they also form a Pareto optimal ex-post equilibrium.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aghassi, M., Bertsimas, D.: Robust game theory. Mathematical Programming 107, 231–273 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Apt, K.R., Conitzer, V., Guo, M., Markakis, V.: Welfare undominated Groves mechanisms. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 426–437. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Apt, K.R., Estévez-Fernández, A.: Sequential pivotal mechanisms for public project problems, Computing Research Repository, CoRR (2008), http://arxiv.org/abs/0810.1383 ; To appear in SAGT 2009: 2nd Symposium on Algorithmic Game Theory

  4. Ashlagi, I., Monderer, D., Tennenholtz, M.: Resource selection games with unknown number of players. In: AAMAS 2006: Proceedings 5th Int. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 819–825. ACM Press, New York (2006)

    Chapter  Google Scholar 

  5. Bailey, M.J.: The demand revealing process: To distribute the surplus. Public Choice 91(2), 107–126 (1997)

    Article  Google Scholar 

  6. Cavallo, R.: Optimal decision-making with minimal waste: Strategyproof redistribution of VCG payments. In: AAMAS 2006: Proceedings of the 5th Int. Joint Conf. on Autonomous Agents and Multiagent Systems, pp. 882–889. ACM Press, New York (2006)

    Chapter  Google Scholar 

  7. Cavallo, R.: Efficiency and redistribution in dynamic mechanism design. In: EC 2008: ACM Conference on Electronic Commerce, pp. 220–229 (2008)

    Google Scholar 

  8. Clarke, E.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)

    Article  Google Scholar 

  9. Guo, M., Conitzer, V.: Worst-case optimal redistribution of VCG payments. In: EC 2007: Proceedings of the 8th ACM conference on Electronic commerce, pp. 30–39. ACM Press, New York (2007)

    Chapter  Google Scholar 

  10. Guo, M., Conitzer, V.: Better redistribution with inefficient allocation in multi-unit auctions with unit demand. In: EC 2008: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 210–219 (2008)

    Google Scholar 

  11. Guo, M., Conitzer, V.: Optimal-in-expectation redistribution mechanisms. In: AAMAS 2008: Proceedings of the 7th Int. Joint Conf. on Autonomous Agents and Multi Agent Systems, pp. 1047–1054 (2008)

    Google Scholar 

  12. Guo, M., Conitzer, V.: Undominated VCG redistribution mechanisms. In: AAMAS 2008: Proc. of 7th Int. Conf. on Autonomous Agents and Multi Agent Systems (2008)

    Google Scholar 

  13. Hartline, J., Roughgarden, T.: Optimal mechanism design and money burning. In: STOC 2008: ACM Symposium on Theory of Computing, pp. 75–84 (2008)

    Google Scholar 

  14. Krishna, V.: Auction Theory, 3rd edn. Academic Press, New York (2002)

    Google Scholar 

  15. Mas-Collel, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  16. Moulin, H.: Efficient, strategy-proof and almost budget-balanced assignment, Working Paper (March 2007)

    Google Scholar 

  17. Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: STOC, pp. 129–140 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apt, K.R., Markakis, E. (2009). Sequential Bidding in the Bailey-Cavallo Mechanism. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10841-9_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10840-2

  • Online ISBN: 978-3-642-10841-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics