Random dictatorship
Generated by GPT-5-miniExpansion Funnel Raw 53 → Dedup 0 → NER 0 → Enqueued 0
| Random dictatorship | |
|---|---|
| Name | Random dictatorship |
| Other names | Lottery dictatorship |
| Field | Social choice theory |
| Introduced | 1970s |
| Notable results | Gibbard–Satterthwaite theorem, Gibbard theorem |
| Related | Random serial dictatorship, Probabilistic social choice, Mechanism design |
Random dictatorship
Random dictatorship is a social choice mechanism in which a single agent is selected by chance and that agent's top-ranked alternative is implemented. It provides a simple randomized rule studied in Kenneth Arrow-related literature and in the context of William Vickrey-style mechanism design, linking probabilistic decision rules with strategic incentives and fairness notions. The mechanism is central to work by Allan Gibbard, Mark Satterthwaite, and Herbert Simon-adjacent streams, and it features in practical designs in settings such as house allocation problem, school choice, and voting theory.
Definition and overview
Random dictatorship selects one member from a finite set of agents according to a specified probability distribution (often uniform) and implements that agent's most-preferred alternative from a finite set of outcomes. The rule contrasts with deterministic dictatorship exemplified by landmarks like Borda count-opposed rules and randomized rules such as Proportional representation-inspired mechanisms. Historically, random dictatorship arose in analyses connected to the Gibbard–Satterthwaite theorem and the study of nonmanipulable social choice correspondences by scholars influenced by Kenneth Arrow and John Harsanyi. The rule is simple to describe but interacts richly with concepts introduced by Amartya Sen, John Rawls, and researchers of fair division.
Formal model and mechanism
Formally, let N denote a finite set of agents and A a finite set of alternatives; each agent i in N reports a complete preference ordering over A. A random dictatorship is a probability distribution p over N together with the selection rule that chooses i with probability p(i) and implements the top-ranked element of i's reported ordering. This model is placed alongside canonical frameworks in mechanism design such as the revealed preference approach and stochastic rules studied in the literature of probabilistic social choice and the random serial dictatorship mechanism introduced in matching theory influenced by Ernst Fehr and Ariel Rubinstein-adjacent authors. The mechanism is represented as a function from the Cartesian product of preference profiles to the simplex over A, akin to representations used in studies by John Nash and Lloyd Shapley on cooperative solutions.
Axiomatic characterization
Random dictatorship is characterized by axioms such as strategyproofness (dominant-strategy incentive compatibility), ex post efficiency, neutrality, and anonymity under certain probability assignments. The canonical axiomatic result links to the Gibbard and Satterthwaite contributions showing that under unrestricted domains the only nonmanipulable and Pareto-efficient deterministic rules are dictatorships, while randomized counterparts give rise to characterizations like those by Hylland and Satterthwaite for probabilistic rules. Formal theorems connect random dictatorship with axioms used by Kenneth Arrow—such as independence of irrelevant alternatives—in probabilistic variants, and are related to impossibility results discussed in research by Amie Wilkinson-adjacent commentators and the aggregation literature of Mancur Olson.
Examples and applications
Random dictatorship is applied in simple allocation problems such as assigning indivisible items in the house allocation problem, where it underpins algorithms like random serial dictatorship used in student assignment systems that reference institutional implementations at entities like Boston Public Schools and reforms influenced by Al Roth. It also appears in committee selection procedures in organizations like United Nations-style bodies where lotteries or random chairs are used in practice, and in laboratory experiments inspired by designs from Vernon Smith and Daniel Kahneman. The mechanism is used in academic settings including course seat allocation at universities such as Harvard University and Massachusetts Institute of Technology where randomized priority is sometimes deployed, and in allocation of scarce resources modeled in studies by Esther Duflo and Angus Deaton.
Analysis of properties and limitations
Random dictatorship satisfies ex post Pareto efficiency provided the selected agent's top choice is not Pareto dominated; it is strategyproof in the sense that agents cannot benefit by misreporting when probabilities are independent of reports. However, limitations include concerns about fairness as evaluated by criteria from John Rawls-inspired egalitarianism, potential violations of ex ante efficiency notions studied by Herbert Simon-influenced scholars, and sensitivity to the choice of probability distribution p, which raises normative questions addressed in literature on social welfare functions and utilitarian aggregation by Jeremy Bentham-linked frameworks. Technical limitations include vulnerability to correlated preferences in large electorates studied by Anthony Downs and computational concerns similar to those in randomized algorithm design in computer science research by Leslie Valiant.
Strategic behavior and incentive compatibility
Under the usual model, random dictatorship is strategyproof: truthful reporting is a dominant strategy for each agent because the realized outcome depends only on the selected agent's report, not on others'. This incentive property is central to mechanism-design results by Allan Gibbard and connects to dominant-strategy implementations in matching problems analyzed by Alvin Roth and Lloyd Shapley. Nonetheless, strategic considerations arise when agents can influence the selection distribution p or when repeated interactions allow for bargaining as studied by scholars such as Robert Aumann and Thomas Schelling. Laboratory and field experiments by Charles Plott and John List explore how real-world strategic behavior departs from theoretical predictions.
Variants and extensions
Variants include random serial dictatorship (RSD) for allocating multiple objects, cardinal-utility extensions that integrate expected-utility maximization as in work by Kenneth Arrow-adjacent welfare economists, and weighted random dictatorship where p is nonuniform reflecting priority structures used in systems studied by Al Roth and Atila Abdulkadiroğlu. Extensions incorporate constraints such as matching with couples studied in Alvin Roth-led literature, stochastic dominance efficiency refinements found in the work of Michel Balinski and Hélène Landry-adjacent researchers, and hybrid mechanisms combining random dictatorship with strategyproof quotas inspired by policy designs at institutions like World Bank and International Monetary Fund.