Skip to main content

Solution-based congestion games

  • Chapter
Advances in Mathematical Economics

Part of the book series: Advances in Mathematical Economics ((MATHECON,volume 8))

Abstract

In this paper we develop the theory of potential of cooperative games for semivalues, characterize congestion models that are defined by semivalues, and suggest an application of these results to combinatorial auctions, which may explain the success of the Iowa electronic market.

This work was partially supported by the Fund of the Israeli Science Foundation, and by the Fund for the Promotion of Research at the Technion.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Altman, E., Wynter, L.: Equilibrium, games and pricing in transportation and telecommunication networks. Networks and Spatial Economics 4, 7–21 (2004)

    Article  MATH  Google Scholar 

  2. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale Univ. Press, New Haven 1956

    Google Scholar 

  3. Clarke, E.: Multipart pricing of public goods. Public Choice 18, 19–33 (1971)

    Google Scholar 

  4. Cramton, P., Shoham, Y., Steinberg, R., eds.: Combinatorial Auctions. MIT Press 2006

    Google Scholar 

  5. Dubey, P., Neyman, A., Weber, R.J.: Value theory without efficiency. Mathematics of Operations Research 6, 122–128 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gilboa, I., Monderer, D.: Quasivalues on subspaces of games. International Journal of Game Theory 19, 353–363 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Groves, T.: Incentives in teams. Econometrica 41, 617–631 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hart, S., Mas-Colell, A.: Potential, value and consistency. Econometrica 57, 589–614(1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling equilibrium in combinatorial auctions. Games and Economic Behavior 47, 104–123 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Holzman, R., Law-yone, N. (Lev-tov): Strong equilibrium in congestion games. Games and Economic Behavior 21, 85–101 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Holzman, R., Monderer, D.: Characterization of ex post equilibrium in the VCG combinatorial auctions. Games and Economic Behavior 47, 87–103 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hyafil, N., Boutilier, C.: Regret minimizing equilibria and mechanisms for games with strict type uncertainty. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI-04). pp.268–277 AUAI Press, Arlington, Virginia 2004

    Google Scholar 

  13. Kearns, M., Littman, M., Singh, S.: Graphical models for game theory. UAI 2001

    Google Scholar 

  14. Koller, D., Milch, B.: Multi-agent influence diagrams for representing and solving games. IJCAI 2001

    Google Scholar 

  15. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 33rd Symposium on Theory of Computing. pp.404–413 1999

    Google Scholar 

  16. Kukushkin, N.S.: Perfect information and potential games. Games and Economic Behavior 38, 306–317 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Leyton-Brown, K., Tennenholtz, M.: Local-effect games. In: International Joint Conferences on Artificial Intelligence (IJCAI). 2003

    Google Scholar 

  18. Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13, 111–124 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  19. Monderer, D.: Multipotential games. working paper (2005) http://ie.technion.ac.il/dov.phtml

    Google Scholar 

  20. Monderer, D., Samet, D.: Variations on the Shapley value. In: HandBook of Game Theory, volume III (R.J. Aumann, S. Hart eds.). Elsevier Science, Amsterdam 2002

    Google Scholar 

  21. Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14, 124–143 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  22. La Mura, P.: Game networks. UAI 2000

    Google Scholar 

  23. Myerson, R.: Conference structures, fair allocation rules. International Journal of Game Theory 9, 169–182 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  24. Bhat, N., Leyton-Brown, K.: Computing Nash equilibria of action-graph games. In: Conference on Uncertainty in Artificial Intelligence (UAI). 2004

    Google Scholar 

  25. Neyman, A.: Uniqueness of the Shapley value. Games and Economic Behavior 1, 116–118(1989)

    Article  MATH  MathSciNet  Google Scholar 

  26. Papadimitriou, C.: Algorithms, games, and the Internet. In: Proceedings of the 16th Annual ACM Symposium on Theoretical Aspects of Computer Science. pp.749–753 2001

    Google Scholar 

  27. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  28. Roughgarden, T.: Selfish routing. PhD thesis, Cornell University (2002)

    Google Scholar 

  29. Sandholm, W.H.: Potential games with continuous player sets. Journal of Economic Theory 97, 81–108 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  30. Schmeidler, D.: Equilibrium points of nonatomic games. Journal of Statistical Phisics 7, 295–300 (1973)

    Article  MathSciNet  Google Scholar 

  31. Shapley, L.S.: A value for n-person games. Annals of Mathematics Studies 28, 307–317(1953)

    MathSciNet  Google Scholar 

  32. Thépot J.: Procedures de centralisation d’un oligopole. Publications Économétriques 13(1), 29–67 (1980)

    MATH  Google Scholar 

  33. Thépot J.: Nash equilibrium as an optimum. WP 81-7, working paper of the European Institute for Advanced Studies in Management, Brussels (1981)

    Google Scholar 

  34. Ui, T.: Robust equilibria of potential games. Econometrica 69, 1373–1380 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  35. Vickrey, D., Koller D.: Multi-agent algorithms for solving graphical games. AAAI 2002

    Google Scholar 

  36. Vickrey W.: Counterspeculations, auctions, and competitive sealed tenders. Journal of Finance 16, 15–27 (1961)

    Article  Google Scholar 

  37. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, volume 1. pp. 325–378 1952

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag

About this chapter

Cite this chapter

Monderer, D. (2006). Solution-based congestion games. In: Kusuoka, S., Yamazaki, A. (eds) Advances in Mathematical Economics. Advances in Mathematical Economics, vol 8. Springer, Tokyo. https://doi.org/10.1007/4-431-30899-7_16

Download citation

Publish with us

Policies and ethics