Walrasian Equilibrium with Few Buyers

  • Reshef Meir
  • Moshe Tennenholtz
Conference paper

DOI: 10.1007/978-3-662-44803-8_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8768)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Reshef Meir
    • 1
  • Moshe Tennenholtz
    • 2
  1. 1.Harvard UniversityUSA
  2. 2.Microsoft Research and Technion-Israel Institute of TechnologyIsrael

Personalised recommendations