Centralization and Stability in Formal Constitutions
Yotam Gafni

TL;DR
This paper investigates the conditions under which social-choice functions remain stable and centralized, especially in formal systems like blockchain DAOs, revealing that only dictatorships are self-maintaining in certain cases.
Contribution
It introduces a framework analyzing self-maintenance of SCFs, providing new theoretical results including an Arrow-style theorem and characterizations of self-maintaining rules.
Findings
Only dictatorships are self-maintaining in the i.i.d. unbiased case.
Self-maintaining rules include all games with minimal winning coalitions of size at most 2.
Less centralized SCFs become self-maintaining with forward-looking voters and crowd wisdom effects.
Abstract
Consider a social-choice function (SCF) is chosen to decide votes in a formal system, including votes to replace the voting method itself. Agents vote according to their ex-ante belief over what decisions are considered, and whether they prefer them to be decided by the incumbent SCF or the suggested replacement. The existing SCF then aggregates the agents' votes and arrives at a decision of whether it should itself be replaced. An SCF is self-maintaining if it can not be replaced in such fashion by any other SCF. Our focus is on the implications of self-maintenance for centralization. For this purpose, unlike [Barbera and Jackson, 2004], we do not generally restrict attention to anonymous SCFs. We also do not restrict attention to neutral SCFs, unlike [Koray, 2000]. We present results considering optimistic, pessimistic and i.i.d. approaches with respect to agent beliefs, different…
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.
