Optimal Allocation Without Money: An Engineering Approach

Published Online:https://doi.org/10.1287/mnsc.2015.2162

References

  • Abdulkadiroğlu A, Sönmez T (2003) School choice: A mechanism design approach. Amer. Econom. Rev. 93(3):729–747.CrossrefGoogle Scholar
  • Abdulkadiroğlu A, Sönmez T (2013) Matching markets: Theory and practice. Acemoglu D, Arellano M, Dekel E, eds. Advances in Economics and Econometrics: 10th World Congress, Volume 1: Economic Theory (Cambridge University Press, New York),3–47.CrossrefGoogle Scholar
  • Abdulkadiroğlu A, Che Y-K, Yasuda Y (2015) Expanding “choice” in school choice. Amer. Econom. J.: Microeconomics 7(1):1–42.CrossrefGoogle Scholar
  • Abdulkadiroğlu A, Pathak PA, Roth AE (2009) Strategy-proofness versus efficiency in matching with indifferences: Redesigning the NYC high school match. Amer. Econom. Rev. 99(5):1954–1978.CrossrefGoogle Scholar
  • Abdulkadiroğlu A, Pathak PA, Roth AE, Sönmez T (2006) Changing the Boston school choice mechanism. Boston College Working Papers in Economics 639, Boston College, Chestnut Hill, MA.CrossrefGoogle Scholar
  • Ashlagi I, Shi P (2014) Improving community cohesion in school choice via correlated-lottery implementation. Oper. Res. 62(6):1247–1264.LinkGoogle Scholar
  • Aumann RJ (1964) Markets with a continuum of traders. Econometrica 32(1):39–50.CrossrefGoogle Scholar
  • Azevedo E, Leshno J (2015) A supply and demand framework for two-sided matching markets. J. Political Econom. Forthcoming.Google Scholar
  • Bogomolnaia A, Moulin H (2001) A new solution to the random assignment problem. J. Econom. Theory 100(2):295–328.CrossrefGoogle Scholar
  • Budish E (2012) Matching versus mechanism design. ACM SIGecom Exchanges 11(2):4–15.CrossrefGoogle Scholar
  • Budish E, Cantillon E (2012) The multi-unit assignment problem: Theory and evidence from course allocation at Harvard. Amer. Econom. Rev. 102(5):2237–2271.CrossrefGoogle Scholar
  • Caro F, Shirabe T, Guignard M, Weintraub A (2004) School redistricting: Embedding GIS tools with integer programming. J. Oper. Res. Soc. 55(8):836–849.CrossrefGoogle Scholar
  • Chakravarty S, Kaplan TR (2013) Optimal allocation without transfer payments. Games Econom. Behav. 77(1):1–20.CrossrefGoogle Scholar
  • Che Y, Kojima F (2011) Asymptotic equivalence of probabilistic serial and random priority mechanisms. Econometrica 78(5):1625–1672.Google Scholar
  • Clarke S, Surkis J (1968) An operations research approach to racial desegregation of school systems. Socio-Econom. Planning Sci. 1(3):259–272.CrossrefGoogle Scholar
  • Condorelli D (2012) What money can’t buy: Efficient mechanism design with costly signals. Games Econom. Behav. 75(2):613–624.CrossrefGoogle Scholar
  • Echenique F, Yenmez MB (2015) How to control controlled school choice. Amer. Econom. Rev. 105(8):2679–2694.CrossrefGoogle Scholar
  • Ehlers L, Hafalir IE, Yenmez MB, Yildirim MA (2014) School choice with controlled choice constraints: Hard bounds versus soft bounds. J. Econom. Theory 153(September):648–683.CrossrefGoogle Scholar
  • Erdil A, Ergin H (2008) What’s the matter with tie-breaking? Improving efficiency in school choice. Amer. Econom. Rev. 98(3):669–689.CrossrefGoogle Scholar
  • Gale D, Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.CrossrefGoogle Scholar
  • Hartline JD, Roughgarden T (2008) Optimal mechanism design and money burning. Proc. 40th Annual ACM Sympos. Theory Comput. (STOC ’08) (ACM, New York), 75–84.CrossrefGoogle Scholar
  • Hoppe HC, Moldovanu B, Sela A (2009) The theory of assortative matching based on costly signals. Rev. Econom. Stud. 76(1):253–281.CrossrefGoogle Scholar
  • Hylland A, Zeckhauser R (1979) The efficient allocation of individuals to positions. J. Political Econom. 87(2):293–314.CrossrefGoogle Scholar
  • Kominers SD, Sönmez T (2015) Matching with slot-specific priorities: Theory. Theoret. Econom. Forthcoming.Google Scholar
  • Liu Q, Pycia M (2013) Ordinal efficiency, fairness, and incentives in large markets. Working paper, University of California, Los Angeles, Los Angeles.Google Scholar
  • Maglaras C, Zeevi A (2005) Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. 53(2):242–262.LinkGoogle Scholar
  • Miralles A (2012) Cardinal Bayesian allocation mechanisms without transfers. J. Econom. Theory 147(1):179–206.CrossrefGoogle Scholar
  • Miralles Asensio A, Pycia M (2014) Prices and efficient assignments without transfers. Working paper, Boston University, Boston. http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2505241.Google Scholar
  • Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.LinkGoogle Scholar
  • Pathak PA, Sethuraman J (2011) Lotteries in student assignment: An equivalence result. Theor. Econom. 6(1):1–17.CrossrefGoogle Scholar
  • Pathak PA, Shi P (2015) Demand modeling, forecasting, and counterfactuals, part I. Working paper, Massachusetts Institute of Technology, Cambridge. http://arxiv.org/abs/1401.7359.Google Scholar
  • Perry O, Whitt W (2009) Responding to unexpected overloads in large-scale service systems. Management Sci. 55(8):1353–1367.LinkGoogle Scholar
  • Pycia M (2014) The cost of ordinality. Working paper, University of California, Los Angeles, Los Angeles. http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2460511.CrossrefGoogle Scholar
  • Roth AE, Sotomayor M (1990) Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Russell J, Ebbert S (2011) The high price of school assignment. Boston Globe (June 12), http://www.boston.com/news/education/k_12/articles/2011/06/12/the_high_price_of_school_assignment/.Google Scholar
  • Schummer J, Vohra R (2007) Mechanism design without money. Nisan N, Roughgarden T, Tardos E, Vazirani VV, eds. Algorithmic Game Theory (Cambridge University Press, Cambridge, UK), 243–266.CrossrefGoogle Scholar
  • Shi P (2013) Closest types: A simple non-zone-based framework for school choice. Memo, Massachusetts Institute of Technology, Cambridge. http://www.mit.edu/~pengshi/papers/closest-types.pdf.Google Scholar
  • Sönmez T, Ünver MU (2010) Course bidding at business schools. Internat. Econom. Rev. 51(1):99–123.CrossrefGoogle Scholar
  • Sutcliffe C, Board J, Cheshire P (1984) Goal programming and allocating children to secondary schools in reading. J. Oper. Res. Soc. 35(8):719–730.CrossrefGoogle Scholar
  • Thomson W, Zhou L (1993) Consistent allocation rules in atomless economies. Econometrica 61(3):575–587.CrossrefGoogle Scholar
  • Tirole J (1988) The Theory of Industrial Organization (MIT Press, Cambridge, MA).Google Scholar
  • Zhou L (1992) Strictly fair allocations in large exchange economies. J. Econom. Theory 57(1):160–175.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.