We introduce the notion of verifiable information into a model of sequential debate among experts who are motivated by career concerns. We show that self-censorship may hamper the efficiency of information aggregation, as experts withhold evidence contradicting the conventional wisdom. In this...

We introduce the notion of verifiable information into a model of sequential debate among experts who are motivated by career concerns. We show that self-censorship may hamper the efficiency of information aggregation, as experts withhold evidence contradicting the conventional wisdom. In this...

We study political competition in an environment in which voters have private information about their preferences. Our framework covers models of income taxation, public-goods provision or publicly provided private goods. Politicians are vote-share-maximizers. They can propose any policy that is...

Compared with the traditional public-finance approach of a monolithic fully informed planner, earmarking of taxation is less likely to be optimal if a principal-agent setting is considered, where taxing and spending are performed by two separate agents which are monitored by the parliament. We...

Mechanisms for Nash implementation in the literature are fragile in the sense that they fail if just one or two players do not follow their equilibrium strategy. A mechanism is outcome-robust if its equilibrium outcome is not affected by any deviating minority of players. Is Nash implementation...

Can mechanism design save democracy? We propose a simple design that offers a chance: individuals pay for as many votes as they wish using a number of "voice credits" quadratic in the votes they buy. Only quadratic cost induces marginal costs linear in votes purchased and thus welfare optimality...

Serizawa [3] characterized the set of strategy-proof, individually rational, no exploitative, and non-bossy social choice functions in economies with pure public goods. He left an open question whether non-bossiness is necessary for his characterization. We will prove that non-bossiness is...

A group of N individuals must choose between two collective alternatives. Under Quadratic Voting (QV), agents buy votes in favor of their preferred alternative from a clearing house, paying the square of the number of votes purchased; the sum of all votes purchased determines the outcome. We...

Lalley and Weyl (2016) propose a mechanism for binary collective decisions, Quadratic Voting, and prove its approximate efficiency in large populations in a stylized environment. They motivate their proposal substantially based on its greater robustness when compared with pre-existing efficient...

Commitment voting is a mechanism for signalling intensity of preferences and long-term commitment to governance decisions in proof of stake blockchains. In commitment voting, the voting weight of a vote in any given election is determined by 1) the amount of tokens under a voters control and 2)...