The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Designing Random Allocation Mechanisms: Theory and Applications
Abstract
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized assignment to accommodate multi-unit allocations and various real-world constraints, such as group-specific quotas (“controlled choice”) in school choice and house allocation, and scheduling and curriculum constraints in course allocation. We develop new mechanisms that are ex ante efficient and fair in these environments, and that incorporate certain non-additive substitutable preferences. We also develop a “utility guarantee” technique that limits ex post unfairness in random allocations, supplementing the ex ante fairness promoted by randomization. This can be applied to multi-unit assignment problems and certain two-sided matching problems. (JEL C78, D82)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
School Choice: A Mechanism Design Approach
Abdulkadiroğlu, A., & Sönmez, T. (2003) · American Economic Review · doi:10.1257/000282803322157061 · Cited by 1,568
Shapley, L. S., & Scarf, H. E. (1974) · Journal of Mathematical Economics · doi:10.1016/0304-4068(74)90033-0 · Cited by 1,158
Hatfield, J. W., & Milgrom, P. R. (2005) · American Economic Review · doi:10.1257/0002828054825466 · Cited by 788
Self-citationThe Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
Budish, E. (2011) · Journal of Political Economy · doi:10.1086/664613 · Cited by 766
Self-citationA New Solution to the Random Assignment Problem
Bogomolnaia, A., & Moulin, H. (2001) · Journal of Economic Theory · doi:10.1006/jeth.2000.2710 · Cited by 726
The New York City High School Match
Abdulkadiroğlu, A., Pathak, P. A., & Roth, A. E. (2005) · American Economic Review · doi:10.1257/000282805774670167 · Cited by 654
Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
Abdulkadiroğlu, A., & Sönmez, T. (1998) · Econometrica · doi:10.2307/2998580 · Cited by 611
(1973) · RAND Corporation eBooks · doi:10.7249/r1056-1 · Cited by 584
Repugnance as a Constraint on Markets
Roth, A. E. (2007) · Journal of Economic Perspectives · doi:10.1257/jep.21.3.37 · Cited by 560
Cited by
The Unreasonable Fairness of Maximum Nash Welfare
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2016) · Proceedings of the 2016 ACM Conference on Economics and Computation · doi:10.1145/2940716.2940726 · Cited by 342
The Unreasonable Fairness of Maximum Nash Welfare
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2019) · ACM Transactions on Economics and Computation · doi:10.1145/3355902 · Cited by 289
School choice with controlled choice constraints: Hard bounds versus soft bounds
Ehlers, L., Hafalir, I. E., Yenmez, M. B., & Yildirim, M. A. (2014) · Journal of Economic Theory · doi:10.1016/j.jet.2014.03.004 · Cited by 283
Lee, M. K., & Baykal, S. (2017) · Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing · doi:10.1145/2998181.2998230 · Cited by 182
Assignment Mechanisms Under Distributional Constraints
Ashlagi, I., Saberi, A., & Shameli, A. (2020) · Operations Research · doi:10.1287/opre.2019.1887 · Cited by 11
Metadata
- Authors
- Budish, E., Che, Y.-K., Kojima, F., & Milgrom, P.
- Venue
- American Economic Review
- Publisher
- American Economic Association
- Published
- 2013-04-01
- Volume
- 103
- Issue
- 2
- Pages
- 585-623
- ISSN
- 0002-8282 (ISSN-L)
- OpenAlex
- W2069259012
- Cited by
- 303
- References
- 33
- FWCI
- 69.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Designing Random Allocation Mechanisms: Theory and Applications. https://app.cochat.ai/papers/10.1257/aer.103.2.585
- The paper
- Budish, E., Che, Y.-K., Kojima, F., & Milgrom, P. (2013). Designing Random Allocation Mechanisms: Theory and Applications. American Economic Review. https://doi.org/10.1257/aer.103.2.585
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.