Funding Public Projects: A Case for the Nash Product Rule
Florian Brandl,
Felix Brandt,
Matthias Greger,
Dominik Peters,
Christian Stricker and
Warut Suksompong
Papers from arXiv.org
Abstract:
We study a mechanism design problem where a community of agents wishes to fund public projects via voluntary monetary contributions by the community members. This serves as a model for public expenditure without an exogenously available budget, such as participatory budgeting or voluntary tax programs, as well as donor coordination when interpreting charities as public projects and donations as contributions. Our aim is to identify a mutually beneficial distribution of the individual contributions. In the preference aggregation problem that we study, agents report linear utility functions over projects together with the amount of their contributions, and the mechanism determines a socially optimal distribution of the money. We identify a specific mechanism -- the Nash product rule -- which picks the distribution that maximizes the product of the agents' utilities. This rule is Pareto efficient, and we prove that it satisfies attractive incentive properties: it spends each agent's contribution only on projects the agent finds acceptable, and agents are strongly incentivized to participate.
Date: 2020-05, Revised 2021-10
New Economics Papers: this item is included in nep-cdm, nep-des, nep-gth, nep-ppm and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations:
Published in Journal of Mathematical Economics, 99:102585 (2022)
Downloads: (external link)
http://arxiv.org/pdf/2005.07997 Latest version (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2005.07997
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators (help@arxiv.org).