Constitutional Governance in Metric Spaces
Ehud Shapiro, Nimrod Talmon

TL;DR
This paper introduces a polynomial-time constitutional governance protocol in metric spaces, integrating aggregation, deliberation, and amendments for digital community decision-making.
Contribution
It proposes a unified framework combining metric-space aggregation, social choice, and AI mediation for digital constitutional governance, with practical implementation insights.
Findings
Proves majority threshold voting weakly dominates sincere voting in utility.
Studies the gap between optimal and achievable consensus outcomes.
Instantiates the framework in seven canonical decision-making settings.
Abstract
Computational social choice and algorithmic decision theory offer rich aggregation theory but no comprehensive process for egalitarian self-governance: aggregation, deliberation, amendment, and consensus are each considered in isolation, with key metric-space aggregators being NP-hard. Here, we propose constitutional governance in metric spaces, integrating these stages into a coherent polynomial-time protocol for constitutional governance. The constitution assigns, per amendable component including itself, a metric space, aggregation rule, and supermajority threshold. Amendments proceed by members voting with their ideal elements, followed by members submitting public proposals carrying supermajority public support under the revealed votes. Public proposals can be sourced from deliberation among members, vote aggregation, or AI mediation. The constitutional rule adopts a supported…
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.
