Optimization-based Mechanisms for the Course Allocation Problem

References

• Akbarpour M, Nikzad A (2019) Approximate random allocation mechanisms. Working paper, Stanford University, Stanford, CA.Google Scholar
• Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6):1061–1103.Crossref, Google 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.Crossref, Google Scholar
• Budish E, Che Y, Kojima F, Milgrom P (2013) Designing random allocation mechanisms: Theory and applications. Amer. Econom. Rev. 103(2):585–623.Crossref, Google Scholar
• Diebold F, Aziz H, Bichler M, Matthes F, Schneider A (2014) Course allocation via stable matching. Bus. Inform. Systems Engrg. 6(2):97–110.Crossref, Google Scholar
• Ehlers L, Klaus B (2003) Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems. Soc. Choice Welfare 21(2):265–280.Crossref, Google Scholar
• Hatfield J (2009) Strategy-proof, efficient, and nonbossy quota allocations. Soc. Choice Welfare 33(3):505–515.Crossref, Google Scholar
• Kahneman D, Tversky A (1984) Choices, values, and frames. Amer. Psychologist 39(4):341–350.Crossref, Google Scholar
• Kominers SD, Ruberry M, Ullman J (2010) Course allocation by proxy auction. Saberi A, ed. 6th Internat. Workshop Internet Network Econom., Lecture Notes in Computer Science, vol. 6484 (Springer, Berlin, Heidelberg), 551–558.Google Scholar
• Krishna A, Ünver U (2008) Improving the efficiency of course bidding at business schools: Field and laboratory studies. Marketing Sci. 27(2):262–282.Link, Google Scholar
• Morrill T (2012) Making efficient school assignment fairer. Working paper, North Carolina State University, Raleigh.Google Scholar
• Nguyen T, Peivandi A, and Vohra R (2014) One-sided matching with limited complementarities. Working Paper No. 14-030, Penn Institute for Economic Research, University of Pennsylvania, Philadelphia.Google Scholar
• Nogareda A, Camacho D (2016) Optimizing satisfaction in a multi-courses allocation problem. Novais P, Camacho D, Analide C, Seghrouchni AEF, Badica C, eds. Intelligent Distributed Computing IX, Proc. 9th Internat. Symp. Intelligent Distributed Comput., Studies in Computational Intelligence, vol. 616 (Springer, Cham, Switzerland), 247–256.Crossref, Google Scholar
• Papai S (2001) Strategyproof and nonbossy multiple assignments. J. Public Econom. Theory 3(3):257–271.Crossref, Google Scholar
• Roth A, Sotomayor M (1990) Two-Sided Matching (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Schummer J, Vohra RV (2007) Mechanism design without money. Nisan N, Roughgarden T, Tardos E, Vazirani V, eds. Algorithmic Game Theory (Cambridge University Press, Cambridge, UK), 243–265.Crossref, Google Scholar
• Sӧnmez T, Ünver U (2010) Course bidding at business schools. Internat. Econom. Rev. 51(1):99–123.Crossref, Google Scholar