Mechanism design asks the reverse of the usual game-theory question. Game theory takes the rules as given and predicts how rational players will behave. Mechanism design fixes the outcome you want – the goods go to whoever values them most, the public good gets funded in proportion to how many people want it, the treasury spends on what the members actually prefer – and then asks what rules would make self-interested players produce it without being asked to be honest, public-spirited, or even well-informed about each other. It is sometimes called inverse game theory for that reason.

The field was formalised by Leonid Hurwicz, who introduced the idea of a mechanism as a message-and-outcome system that could be compared on informational as well as allocative grounds, and extended by Eric Maskin on implementation and Roger Myerson on optimal design under private information. The three shared the 2007 Nobel Memorial Prize, with the official motivation “for having laid the foundations of mechanism design theory”. Their Nobel lectures – Hurwicz, Maskin and Myerson – remain the most accessible primary statements of what the field is for.

This matters to a DAO because a DAO is nothing but a mechanism. It has no manager who can override a bad outcome, no court that will read intent instead of text, and no way to punish a member for voting in their own interest. Whatever the rules reward is what the organisation will do. Most of the recurring failures catalogued under how DAOs fail are not failures of virtue; they are mechanisms behaving exactly as written.

The vocabulary: what a mechanism has to satisfy

A mechanism is judged against a short list of properties, and almost every design argument in DAO governance is really an argument about which of them to give up.

• Incentive compatibility (IC). Reporting your true preference is at least as good for you as any lie. The strong form, dominant-strategy incentive compatibility, holds no matter what anyone else does; the weaker Bayesian form holds only in expectation, given beliefs about others.
• Individual rationality (IR). Nobody is worse off for taking part than for staying out. A voting system that lets a majority expropriate a minority is not individually rational for the minority, which is why exit rights keep reappearing as a design patch.
• Budget balance. The mechanism does not need an outside subsidy to run. Quadratic funding is famously not budget balanced – it requires a matching pool – which is a design choice, not an oversight.
• Efficiency. The allocation maximises total value. This is the property most often sacrificed, because the impossibility results below say you frequently cannot have it alongside the others.

The single most useful theorem in the field compresses the search space enormously. The revelation principle, set out in Myerson's Nobel lecture, says that any outcome achievable by any mechanism – however baroque its messages, rounds, or side-payments – is also achievable by a direct mechanism in which every player simply reports their private information truthfully. So a designer never has to invent clever message formats: it is enough to ask what truthful-reporting rules are feasible, and if none produces the outcome you want, no elaborate procedure will either.

What the impossibility results rule out

Mechanism design is as valuable for what it forecloses as for what it builds. Three results bound almost every governance argument.

Gibbard–Satterthwaite (Allan Gibbard 1973, Mark Satterthwaite 1975): for any voting rule over three or more outcomes that is deterministic, non-dictatorial, and can produce every outcome, there exist preferences under which some voter does better by misreporting. Strategic voting is not a defect of a particular ballot design – it is unavoidable. Any claim that a new voting scheme “eliminates strategic voting” is therefore false as stated; the honest version is that it changes which misreports pay, and how hard they are to coordinate. This is the theorem that governs the comparison between token-weighted voting, conviction voting and the rest.

Myerson–Satterthwaite (1983): when a buyer and a seller each hold private valuations and either may refuse to trade, no mechanism is simultaneously efficient, budget-balanced and individually rational. Some gains from trade are always lost. This is the formal reason a treasury cannot simply “buy out” a dissenting member at a fair price by asking both sides what the stake is worth, and it is the theorem lurking behind every buyback, ragequit valuation and Harberger tax proposal.

Arrow's impossibility theorem (1951) sits underneath both: no rank-order rule for three or more options can satisfy unrestricted domain, unanimity, independence of irrelevant alternatives and non-dictatorship at once. Aggregating preferences is not a solved engineering problem waiting for better software.

The practical upshot for a DAO is modest but real. You cannot design your way to a mechanism with no strategic play and no losses. You can choose which strategic play is cheap and which is expensive, and you can make the expensive kind visible.

Auctions: the worked example the field was built on

Auctions are where mechanism design is most fully solved, and where the theory earned its second Nobel: Paul Milgrom and Robert Wilson took the 2020 prize “for improvements to auction theory and inventions of new auction formats”.

The canonical result is William Vickrey's: in a sealed-bid auction where the winner pays the second-highest bid, bidding your true value is a dominant strategy. You cannot improve your outcome by shading, because your bid determines only whether you win, not what you pay. Generalised to many goods, this becomes the Vickrey–Clarke–Groves (VCG) mechanism: each winner pays the externality they impose on everyone else. VCG is efficient and dominant-strategy incentive-compatible, and it is also fragile in exactly the ways that matter on a blockchain – it can generate very low revenue, and it is vulnerable to a bidder splitting into several identities, which is the general form of the Sybil problem.

That fragility is the bridge to crypto. A permissionless system cannot assume one person equals one bidder, cannot assume bidders are not the same party, and cannot assume the auctioneer is honest – the auctioneer is a validator with its own position. Every clean auction-theoretic result has to be re-derived under those weaker assumptions, which is most of what blockchain mechanism-design research has been doing since 2019.

Where blockchains actually do mechanism design

Three deployed examples show the field applied at scale, and all three are readable in primary sources.

Transaction fee markets. EIP-1559 (Buterin, Conner, Dudley, Slipper, Norden and Bakhta, created 13 April 2019, now Final) replaced a first-price gas auction with a protocol-set base fee that is burned and adjusts with demand, plus a priority tip the block producer keeps. Tim Roughgarden's economic analysis (arXiv:2012.00854, December 2020) is the reference treatment: it formalises what a transaction fee mechanism must satisfy for both users and block producers, and shows the base-fee burn is what makes the producer side incentive-compatible – a producer who kept the base fee would have a reason to manufacture demand and inflate it. The EIP itself states the point plainly, that burning the base fee “removes miner incentive to manipulate the fee”.

Block-space allocation. Proposer–builder separation turns block construction into a repeated auction between specialised builders and the validator who holds the slot. It is a mechanism-design response to MEV: rather than pretend ordering has no value, PBS makes the value explicit and auctions it, on the theory that a competitive auction returns it to validators instead of to whoever runs the fastest bot. Whether that competition materialises is an empirical question, and the concentration numbers on the MEV page are the honest answer to it.

Public-goods funding. Quadratic funding, from Buterin, Hitzig and Weyl's A Flexible Design for Funding Public Goods (arXiv:1809.06421, September 2018), allocates a matching pool by the square of the sum of the square roots of contributions – a rule chosen precisely because, under its assumptions, it is the one that funds public goods at the socially optimal level. Its assumptions are also its weak point: it presumes distinct, non-colluding contributors, which is why every deployment pairs it with identity infrastructure. Retroactive public goods funding is the alternative bet – that judging results after the fact is an easier problem than eliciting preferences beforehand.

Why DAO governance is the hard case

Classical mechanism design assumes players cannot make binding side deals. Break that assumption and most of the guarantees evaporate, because a mechanism that is incentive-compatible for an individual is rarely incentive-compatible for a coalition that can pay its members to deviate together. Vitalik Buterin's On Collusion (April 2019) is the standard statement of the problem in a blockchain setting, and its conclusion is uncomfortable: the properties that make on-chain governance attractive – transparent, verifiable, tradeable votes – are the same properties that make collusion cheap to arrange and easy to enforce.

Two DAO-specific pressures follow directly.

• Votes are for sale because they are transferable. If a governance token can be bought, borrowed or delegated, then influence can be rented for exactly one decision. That is the whole subject of vote markets and governance bribery, and it is why vote-escrow lockups exist – not to reward loyalty, but to raise the cost of renting a position for a single vote.
• Identity is not free. Every mechanism that treats participants as distinct people rather than distinct balances – quadratic voting, quadratic funding, one-person-one-vote – imports an identity assumption that the base layer does not supply. In practice the mechanism is only as strong as the Sybil resistance bolted on beside it.

Buterin's Moving beyond coin voting governance (August 2021) sets out the resulting design space, and DAOs are not corporations (September 2022) makes the case that decentralisation is worth its cost in exactly the decisions where an adversary would otherwise capture a single point of control. Both are useful correctives to the assumption that a DAO should converge on corporate governance with extra steps.

How Caper approaches this

Caper's answer is to keep the mechanism small enough to reason about, and to price the two things that usually go unpriced: liquidity and exit.

Every caper token trades against a bonding curve rather than an order book, so the price of any trade is a closed-form function of circulation, computable before you sign. There is no discretionary market maker to model and no liquidity that can be withdrawn, which removes a whole class of strategic behaviour rather than trying to disincentivise it.

Voting weight is deliberately not a pure token count. Caper computes it as (t × v) / (V × T) – your holdings t against circulating supply T, multiplied by your accumulated vote tokens v against the total vote supply V – so influence is the product of stake and demonstrated participation. Buying a large position confers weight only in combination with a voting record that has to be built over time, which raises the cost of the rent-a-vote pattern described above without pretending to eliminate it.

The same expression is the exit formula: a member redeeming their stake receives that identical fraction of the treasury. Voice and exit are priced by one number, which is a direct response to the individual-rationality problem – a member who loses a vote is never trapped, and a majority that wants to expropriate a minority has to buy them out at the same rate it grants them influence. For the mechanics themselves, see what is a caper and voting mechanisms.

References and further reading

• The Sveriges Riksbank Prize in Economic Sciences 2007 – Hurwicz, Maskin and Myerson, “for having laid the foundations of mechanism design theory”; see also the prize committee's advanced information document
• Perspectives on Mechanism Design in Economic Theory – Roger Myerson's Nobel lecture, the clearest primary account of the revelation principle and of what mechanism design is for
• But Who Will Guard the Guardians? – Leonid Hurwicz's Nobel lecture on enforcement and the limits of self-implementing rules
• Mechanism Design: How to Implement Social Goals – Eric Maskin's Nobel lecture on implementation theory
• The Sveriges Riksbank Prize in Economic Sciences 2020 – Milgrom and Wilson, “for improvements to auction theory and inventions of new auction formats”
• Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559 – Tim Roughgarden, arXiv:2012.00854, 1 December 2020
• EIP-1559: Fee market change for ETH 1.0 chain – created 13 April 2019, status Final
• A Flexible Design for Funding Public Goods – Buterin, Hitzig and Weyl, arXiv:1809.06421, 17 September 2018, the quadratic-funding paper
• On Collusion – Vitalik Buterin, April 2019, on why coalition-proofness is the binding constraint on-chain
• Moving beyond coin voting governance – August 2021; and DAOs are not corporations – September 2022