Abstract
Negotiation-range mechanisms offer a novel approach to achieving efficient markets based on finding the maximum weighted matching in a weighted bipartite graph connecting buyers and sellers. Unlike typical markets, negotiation-range mechanisms establish negotiation terms between paired bidders rather than set a final price for each transaction. This subtle difference allows single-unit heterogenous negotiation-range markets to achieve desirable properties that cannot coexist in typical markets. This paper extends the useful properties of negotiation-range mechanisms to include coalition-resistance, making them the first markets known to offer protection from coalitions. Additionally, the notion of negotiation-range mechanisms is extended to include a restricted setting of combinatorial markets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartal, Y., Gonen, R., La Mura, P.: Negotiation-Range Mechanisms: Exploring the Limits of Truthful Efficient Markets. In: Proc. of 5th EC, pp. 1–8 (2004)
Bartal, Y., Gonen, R., Nisan, N.: Incentive Compatible Multi-Unit Combinatorial Auctions. In: Proc. of 9th TARK, pp. 72–87 (2003)
Clarke, E.H.: Multipart Pricing of Public Goods. Journal of Public Choice 2, 17–33 (1971)
Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences 63(1) (2001)
Goldberg, A.V., Hartline, J.D.: Envy-Free Auctions for Digital Goods. In: Proc. of the 4th EC, pp. 29–35 (2003)
Gonen, R.: Coalition Resistance. Preliminary version (2003)
Gonen, R.: Negotiation-Range Mechanisms: Coalition Resistance Markets, http://www.cs.huji.ac.il/rgonen
Groves, T.: Incentives in teams. Journal of Econometrica 41, 617–631 (1973)
Lavi, R., Mu’alem, A., Nisan, N.: Towards a Characterization of Truthful Combinatorial Auctions. In: Proc. of 44th FOCS (2003)
Lehmann, D., O’Callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM 49(5), 577–602 (2002)
Myerson, R., Satterthwaite, M.: Efficient Mechanisms for Bilateral Trading. Journal of Economic Theory 28, 265–281 (1983)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of STOC (1999)
Papadimitriou, C.: Algorithm, Games, and the Internet. In: Proc. of STOC (2001)
Parkes, D.C., Kalagnanam, J., Eso, M.: Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges. In: Proc. of 17th IJCAI, pp. 1161–1168 (2001)
Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance 16, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonen, R. (2004). Negotiation-Range Mechanisms: Coalition-Resistant Markets. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive