Skip to main content

Walrasian Equilibrium with Few Buyers

  • Conference paper
Algorithmic Game Theory (SAGT 2014)

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

Included in the following conference series:

  • 1625 Accesses

Abstract

We study the existence and the properties of Walrasian equilibrium (WEQ) in combinatorial auctions, under two natural classes of valuation functions. The first class is based on additive capacities or weights, and the second on the influence in a social network. While neither class holds the gross substitutes condition, we show that in both classes the existence of WEQ is guaranteed under certain restrictions, and in particular when there are only two competing buyers.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ben-Zwi, O., Lavi, R., Newman, I.: Ascending auctions and walrasian equilibrium. ArXiv preprint ArXiv:1301.1153 (2013)

    Google Scholar 

  2. Bikhchandani, S., Mamer, J.W.: Competitive equilibrium in an exchange economy with indivisibilities. Journal of Economic Theory 74(2), 385–413 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blumrosen, L., Nisan, N.: Combinatorial auctions. In: Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V. (eds.) Algorithmic Game Theory. Cambridge University Press (2007)

    Google Scholar 

  4. Boal, W.M., Ransom, M.R.: Monopsony in the labor market. Journal of Economic Literature 35(1), 86–112 (1997)

    Google Scholar 

  5. Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006, pp. 1064–1073. ACM (2006)

    Google Scholar 

  6. Farkas, I.J., Derényi, I., Barabási, A.-L., Vicsek, T.: Spectra of real-world graphs: Beyond the semicircle law. Physical Review E 64(2), 026704 (2001)

    Google Scholar 

  7. Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12(3), 211–223 (2001)

    Article  Google Scholar 

  8. Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. Journal of Economic Theory 87(1), 95–124 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. He, X., Kempe, D.: Price of anarchy for the n-player competitive cascade game with submodular activation functions. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 232–248. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Kelso Jr., A.S., Crawford, V.P.: Job matching, coalition formation, and gross substitutes. Econometrica 50(6), 1483–1504 (1982)

    Article  MATH  Google Scholar 

  11. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD 2003, pp. 137–146 (2003)

    Google Scholar 

  12. Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55(2), 270–296 (2006)

    Google Scholar 

  13. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: WWW 2008, pp. 695–704. ACM (2008)

    Google Scholar 

  14. Meir, R., Tennenholtz, M.: Equilibrium in Labor Markets with Few Firms. Tech. Rep. ArXiv: 1306.5855 [cs.GT]. ACM Comp. Research Repository (2013)

    Google Scholar 

  15. Sun, N., Yang, Z.: Equilibria and indivisibilities: Gross substitutes and complements. Econometrica 74(5), 1385–1402 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meir, R., Tennenholtz, M. (2014). Walrasian Equilibrium with Few Buyers. In: Lavi, R. (eds) Algorithmic Game Theory. SAGT 2014. Lecture Notes in Computer Science, vol 8768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44803-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44803-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44802-1

  • Online ISBN: 978-3-662-44803-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics