Abstract
Many scenarios where participants hold private information require payments to encourage truthful revelation. Some of these scenarios have no natural residual claimant who would absorb the budget surplus or cover the deficit. Faltings [7] proposed the idea of excluding one agent uniformly at random and making him the residual claimant. Based on this idea, we propose two classes of public good mechanisms and derive optimal ones within each class: Faltings’ mechanism is optimal in one of the classes. We then move on to general mechanism design settings, where we prove guarantees on the social welfare achieved by Faltings’ mechanism. Finally, we analyze a modification of the mechanism where budget balance is achieved without designating any agent as the residual claimant.
Part of the work was performed while the first four authors were at Centrum Wiskunde & Informatica (CWI) in Amsterdam. Conitzer gratefully acknowledges NSF IIS-0812113, IIS-0953756, and CCF-1101659, as well as an Alfred P. Sloan fellowship, for support. Naroditskiy and Jennings gratefully acknowledge funding from the UK Research Council for project ’Orchid’, grant EP/I011587/1. Greenwald gratefully acknowledges NSF Grant CCF-0905234.
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
Apt, K.R., Conitzer, V., Guo, M., Markakis, E.: Welfare Undominated Groves Mechanisms. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 426–437. Springer, Heidelberg (2008)
Apt, K.R., Estévez-Fernández, A.: Sequential pivotal mechanisms for public project problems. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 85–96. Springer, Heidelberg (2009)
Bailey, M.J.: The demand revealing process: To distribute the surplus. Public Choice 91(2), 107–126 (1997)
Cavallo, R.: Optimal decision-making with minimal waste: Strategyproof redistribution of VCG payments. In: AAMAS 2006, Hakodate, Japan (2006)
de Clippel, G., Naroditskiy, V., Greenwald, A.: Destroy to save. In: EC 2009 (2009)
Faltings, B.: A budget-balanced, incentive-compatible scheme for social choice (2004) (unpublished)
Faltings, B.: A Budget-Balanced, Incentive-Compatible Scheme for Social Choice. In: Faratin, P., Rodríguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS (LNAI), vol. 3435, pp. 30–43. Springer, Heidelberg (2006)
Faltings, B.: Social choice determination systems and methods, United States Patent (2011)
Gujar, S., Narahari, Y.: Redistribution mechanisms for assignment of heterogeneous objects. Journal of Artificial Intelligence Research 41, 131–154 (2011)
Guo, M., Conitzer, V.: Better redistribution with inefficient allocation in multi-unit auctions with unit demand. In: EC 2008, pp. 210–219 (2008)
Guo, M., Conitzer, V.: Worst-case optimal redistribution of VCG payments in multi-unit auctions. Games and Economic Behavior 67(1), 69–98 (2009)
Guo, M., Conitzer, V.: Optimal-in-expectation redistribution mechanisms. Artif. Intell. 174(5-6), 363–381 (2010)
Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)
Moulin, H.: Almost budget-balanced VCG mechanisms to assign multiple objects. Journal of Economic Theory 144(1), 96–119 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, M., Naroditskiy, V., Conitzer, V., Greenwald, A., Jennings, N.R. (2011). Budget-Balanced and Nearly Efficient Randomized Mechanisms: Public Goods and beyond. In: Chen, N., Elkind, E., Koutsoupias, E. (eds) Internet and Network Economics. WINE 2011. Lecture Notes in Computer Science, vol 7090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25510-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25510-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25509-0
Online ISBN: 978-3-642-25510-6
eBook Packages: Computer ScienceComputer Science (R0)