...if there is a situation with some fixed pool of resources and some currently established mechanism for distributing those resources, and it’s unavoidably possible for 51% of the participants can conspire to seize control of the resources, no matter what the current configuration is there is always some conspiracy that can emerge that would be profitable for the participants.
...This fact, the instability of majority games under cooperative game theory, is arguably highly underrated as a simplified general mathematical model of why there may well be no “end of history” in politics and no system that proves fully satisfactory; I personally believe it’s much more useful than the more famous Arrow’s theorem, for example.
I’ve found this post quite useful in thinking about mechanism design and problems of designing stable systems.
Votes have to ultimately accrue to super cooperators (cooperators who take on enforcement costs for the payoff distribution) via some mechanism for stability.
I think that this assumes what crypto-calls “extra-protocol incentives”, that is, the supercooperators get payoffs from cooperating that exist outside of the game. I’m unsure if this practically solves the problem (was working on something like that solution for a while with Verity) but it definitely doesn’t solve the theoretical version of this problem.
Errata:
to conspire