Fair Division Explained: Cake-Cutting, Game Theory & Dispute Resolution for DAO Governance | Bitlemmas Ep. 21
Bitcoin, game theory, and mechanism design collide in this deep dive into "Fair Division: From Cake-Cutting to Dispute Resolution" by Steven Brams and Alan Taylor. Hosts Watson and B. Sovereign break down what fairness actually means when values are private, strategic, and hard to compare, and why that matters for anyone designing token distributions, DAO treasuries, or governance systems.
We cover the four counterintuitive truths of fair division: fair does not mean equal, proportional does not mean envy-free, perfect fairness properties can conflict, and dispute resolution is mechanism design. Along the way we unpack divide-and-choose, the Adjusted Winner procedure, the Nash bargaining solution, entitlements vs. endowments, and why "fair" is really a bundle of separate properties: proportionality, envy-freeness, equitability, and efficiency.
If you're building multiparty allocation systems, governance weights, or network rewards, this episode gives you a framework for asking the right question before conflict starts: what does your procedure actually guarantee?
Timestamps
00:00 Introduction: Fair Division by Brams and Taylor
06:00 Why fairness starts with whose valuation counts
07:31 Truth #2: Proportional does not mean envy-free
10:29 Envy as a voice signal (callback to Ep. 13)
12:09 Entitlements vs. endowments
18:25 Truth #3: The property triangle (efficiency, equitability, envy-freeness)
19:50 Truth #4: Dispute resolution is mechanism design
21:12 Announced values, strategy, and safety valves
23:00 The Adjusted Winner procedure explained
31:50 Critiquing fair division as a language
33:36 Exit paths and choke-point analysis
36:16 Builder takeaways and conclusion
Leave your thoughts in the comments and find more episodes at bitlemmas.com
