Abstract
In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating preferences to determine an allocation of funds to projects. We argue that the classic game theoretic notion of core captures fairness in the setting. To compute the core, we first develop a novel characterization of a public goods market equilibrium called the Lindahl equilibrium. We then provide the first polynomial time algorithm for computing such an equilibrium for a broad set of utility functions. We empirically show that the core can be efficiently computed for utility functions that naturally model data from real participatory budgeting instances, and examine the relation of the core with the welfare objective. Finally, we address concerns of incentives and mechanism design by developing a randomized approximately dominant-strategy truthful mechanism building on the Exponential Mechanism from differential privacy.
B. Fain—Supported by NSF grants CCF-1637397 and IIS-1447554.
A. Goel—Supported by the Army Research Office Grant No. 116388, the Office of Naval Research Grant No. 11904718, by NSF grant CCF-1637418, and by the Stanford Cyber Initiative.
K. Munagala—Supported by NSF grants CCF-1408784, CCF-1637397, and IIS-1447554.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that the core remains unchanged if utilities undergo a monotone transform.
References
Azevedo, E.M., Budish, E.B.: Strategy-proofness in the large. In: Chicago Booth Research Paper, pp. 13–35 (2013)
Azevedo, E.M., Budish, E.: Strategyproofness in the large as a desideratum for market design. In: EC, pp. 55–55 (2012)
Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061–1103 (2011)
Cabannes, Y.: Participatory budgeting: a significant contribution to participatory democracy. Environ. Urbanization 16(1), 27–46 (2004)
Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)
Dughmi, S.: A truthful randomized mechanism for combinatorial public projects via convex optimization. CoRR abs/1103.0041 (2011)
Fain, B., Goel, A., Munagala, K.: The core of the participatory budgeting problem. arXiv e-prints CoRR:1610.03474 (2016). https://arxiv.org/pdf/1610.03474v2.pdf
Foley, D.K.: Lindahl’s solution and the core of an economy with public goods. Econometrica 38(1), 66–72 (1970)
Goel, A., Krishnaswamy, A.K., Sakshuwong, S.: Budget aggregation via knapsack voting: welfare-maximization and strategy-proofness. In: Collective Intelligence (2016). http://web.stanford.edu/~anilesh/publications/GoKrSu_budget.pdf
Goel, A., Krishnaswamy, A.K., Sakshuwong, S., Aitamurto, T.: Knapsack voting. In: Collective Intelligence (2015). http://web.stanford.edu/~anilesh/publications/knapsack_voting.pdf
Groves, T., Ledyard, J.: Optimal allocation of public goods: a solution to the “free rider” problem. Econometrica 45(4), 783–809 (1977)
Jain, K., Vazirani, V.V.: Eisenberg-gale markets: algorithms and structural properties. In: Proceedings of the ACM Symposium Theory of Computing, STOC 2007, pp. 364–373 (2007)
Jain, K., Vazirani, V.V., Ye, Y.: Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. In: Proceedings of the ACM-SIAM Symposium Discrete Algorithms, SODA 2005, pp. 63–71 (2005)
Lalley, S.P., Weyl, E.G.: Quadratic voting. Available at SSRN 2003531 (2015)
Lindahl, E.: Just taxation: a positive solution. In: Musgrave, R.A., Peacock, A.T. (eds.) Classics in the Theory of Public Finance. Palgrave Macmillan, Basingstoke (1958)
Liu, Q., Pycia, M.: Ordinal efficiency, fairness, and incentives in large markets (2012)
Lovász, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30(3), 307–358 (2007). http://dl.acm.org/citation.cfm?id=1234701
McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2007)
Muench, T.J.: The core and the lindahl equilibrium of an economy with a public good: an example. J. Econ. Theory 4(2), 241–255 (1972)
Nash, J.F.: The bargaining problem. Econometrica 18(2), 155–162 (1950)
PB-Stanford: Stanford participatory budgeting platform. Website (2015). https://pbstanford.org
PBP: Where has it worked? - the participatory budgeting project (2016). http://www.participatorybudgeting.org/about-participatory-budgeting/where-has-it-worked/
Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM EC, EC 2009, pp. 177–186 (2009)
Samuelson, P.A.: The pure theory of public expenditure. Rev. Econ. Stat. 36(4), 387–389 (1954). http://www.jstor.org/stable/1925895
Scarf, H.E.: The core of an n person game. Econometrica 35(1), 50–69 (1967)
Vazirani, V.V.: Nash bargaining via flexible budget markets. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, p. 2. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68880-8_2
Vazirani, V.V., Yannakakis, M.: Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM 58(3), 10:1–10:10 (2011)
Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finan. 16(1), 8–37 (1961)
Acknowledgements
We thank Anilesh Krishnaswamy for useful discussions, and the Stanford Crowdsourced Democracy Team for the use of their data.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag GmbH Germany
About this paper
Cite this paper
Fain, B., Goel, A., Munagala, K. (2016). The Core of the Participatory Budgeting Problem. In: Cai, Y., Vetta, A. (eds) Web and Internet Economics. WINE 2016. Lecture Notes in Computer Science(), vol 10123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54110-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-662-54110-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-54109-8
Online ISBN: 978-3-662-54110-4
eBook Packages: Computer ScienceComputer Science (R0)