A Participatory Democratic Budgeting Algorithm
Ehud Shapiro, Nimrod Talmon

TL;DR
This paper introduces a polynomial-time algorithm for creating democratically optimal budgets that are transparent, inclusive, and reflect collective preferences, applicable to various organizations and decision-making bodies.
Contribution
It presents a novel algorithm that efficiently produces democratically optimal budgets based on diverse voting inputs and historical data.
Findings
Algorithm is polynomial-time and Condorcet-consistent.
Supports flexible vote elicitation methods.
Ensures budgets are democratically optimal.
Abstract
The budget is the key means for effecting policy in democracies, yet its preparation is typically an excluding, opaque, and arcane process. We aim to rectify this by providing for the democratic creation of complete budgets --- for cooperatives, cities, or states. Such budgets are typically (i) prepared, discussed, and voted upon by comparing and contrasting with last-year's budget, (ii) quantitative, in that items appear in quantities with potentially varying costs, and (iii) hierarchical, reflecting the organization's structure. Our process can be used by a budget committee, the legislature or the electorate at large. We allow great flexibility in vote elicitation, from perturbing last-year's budget to a complete ranked budget proposal. We present a polynomial-time algorithm which takes such votes, last-year's budget, and a budget limit as input and produces a budget that is provably…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Electoral Systems and Political Participation · Auction Theory and Applications
