Group strategyproof cost sharing: The role of indifferences
Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an indifferent agent is always served. With the minimalist rule (MIN) an indifferent agent does not get a unit of the good.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 18(3), pages 511-533.
- Dutta, Bhaskar & Ray, Debraj, 1989. "A Concept of Egalitarianism under Participation Constraints," Econometrica, Econometric Society, vol. 57(3), pages 615-635, May.
- Itai Ashlagi & Shigehiro Serizawa, 2012. "Characterizing Vickrey allocation rule by anonymity," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 531-542, March.
- Lars-Gunnar Svensson & Bo Larsson, 2002.
"Strategy-proof and nonbossy allocation of indivisible goods and money,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 20(3), pages 483-502.
- Svensson, Lars-Gunnar & Larsson, Bo, 2000. "Strategy-Proof and Nonbossy Allocation of Indivisible Goods and Money," Working Papers 2000:11, Lund University, Department of Economics.
- Mehta, Aranyak & Roughgarden, Tim & Sundararajan, Mukund, 2009. "Beyond Moulin mechanisms," Games and Economic Behavior, Elsevier, vol. 67(1), pages 125-155, September.
- Moulin Herve & Shenker Scott, 1994. "Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison," Journal of Economic Theory, Elsevier, vol. 64(1), pages 178-201, October.
- Papai, Szilvia, 1996. "Strategyproof and Nonbossy Assignments," Working Papers 938, California Institute of Technology, Division of the Humanities and Social Sciences.
- Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
- Deb, Rajat & Razzolini, Laura, 1999. "Voluntary cost sharing for an excludable public project," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 123-138, March.
- Schummer, James, 2000. "Manipulation through Bribes," Journal of Economic Theory, Elsevier, vol. 91(2), pages 180-198, April.
- James Schummer, 1997. "Manipulation Through Bribes," Discussion Papers 1207, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- HervÊ Moulin, 1999. "Incremental cost sharing: Characterization by coalition strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(2), pages 279-320.
- Mutuswami, Suresh, 2005. "Strategyproofness, Non-Bossiness and Group Strategyproofness in a cost sharing model," Economics Letters, Elsevier, vol. 89(1), pages 83-88, October.
- Ehlers, Lars, 2002. "Coalitional Strategy-Proof House Allocation," Journal of Economic Theory, Elsevier, vol. 105(2), pages 298-317, August.
- Ruben Juarez, 2008. "The worst absolute surplus loss in the problem of commons: random priority versus average cost," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 34(1), pages 69-84, January. Full references (including those not matched with items on IDEAS)