Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation

References

• Abbott T, Kane D, Valiant P (2005) On the complexity of two-player win-lose games. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2005), (IEEE Computer Society Press, Los Alamitos, CA), 113–122.Crossref, Google Scholar
• Abdulkadiroğlu A, Sönmez T (2003) School choice: A mechanism design approach. Amer. Econom. Rev. 93(3):729–747.Crossref, Google Scholar
• Azevedo E, Budish E (2015) Strategy-proofness in the large. Working paper, Wharton School of Business, University of Pennsylvania, Philadelphia.Google Scholar
• Borgs C, Chayes J, Immorlica N, Kalai AT, Mirrokni V, Papadimitriou C (2008) The myth of the folk theorem. Proc. 40th Annual ACM Sympos. Theory Comput. (STOC ’08) (ACM, New York), 365–372.Crossref, 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, Kessler J (2015) Experiments as a bridge from market design theory to market design practice: Changing the course allocation mechanism at Wharton. Working paper, University of Chicago, Chicago.Google Scholar
• Chen X, Teng S-H (2009) Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria. Algorithms and Computation: Proc. 20th Internat. Sympos. Algorithms Comput., Lecture Notes in Computer Science, Vol. 5878 (Springer, Berlin), 647–656.Crossref, Google Scholar
• Chen X, Teng S-H (2011) A complexity view of markets with social influence. Proc. 2011 Internat. Conf. Supercomputing (ACM, New York), 141–154.Google Scholar
• Chen X, Paparas D, Yannakakis M (2013) The complexity of non-monotone markets. Proc. 45th Annual ACM Sympos. Theory Computing (STOC ’13) (ACM, New York), 181–190.Crossref, Google Scholar
• Codenotti B, Saberi A, Varadarajan K, Ye Y (2006) Leontief economies encode nonzero sum two-player games. Report TR05-055, Electronic Colloquium on Computational Complexity, Potsdam, Germany.Google Scholar
• Daskalakis C, Goldberg PW, Papadimitriou CH (2009) The complexity of computing a Nash equilibrium. Comm. ACM 52(2):89–97.Crossref, Google Scholar
• Huang L-S, Teng S-H (2007) On the approximation and smoothed complexity of Leontief market equilibria. Preparata FP, Fang Q, eds. Proc. 1st Annual Internat. Conf. Frontiers Algorithmics, Lecture Notes in Computer Science, Vol. 4613 (Springer, Berlin), 96–107.Crossref, Google Scholar
• Kintali S, Poplawski LJ, Rajaraman R, Sundaram R, Teng S-H (2009) Reducibility among fractional stability problems. Proc. 2009 50th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS ’09) (IEEE Computer Society, Washington, DC), 283–292.Crossref, Google Scholar
• Krishna A, Ünver MU (2008) Improving the efficiency of course bidding at business schools: Field and laboratory studies. Marketing Sci. 27(2):262–282.Link, Google Scholar
• Othman A, Budish E, Sandholm T (2010) Finding approximate competitive equilibria: Efficient and fair course allocation. Luck M, Sen S, eds. Internat. Conf. Autonomous Agents and Multi-Agent Systems (AAMAS) (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 873–880.Google Scholar
• Othman A, Papadimitriou C, Rubinstein A (2014) The complexity of fairness through equilibrium. Proc. 15th ACM Conf. Econom. Comput. (EC ’14) (ACM, New York), 209–226.Crossref, Google Scholar
• Pálvölgyi D (2009) 2D-Tucker is PPAD-complete. Leonardi S, ed. Proc. 5th Internat. Workshop Internet Network Econom. (Springer, Berlin), 569–574.Crossref, Google Scholar
• Papadimitriou CH (1994) On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. 48(3):498–532.Crossref, Google Scholar
• Roth AE (2002) Economist as engineer: Game theory, experimentation, and computation as tools for design economics. Econometrica 70(4):1341–1378.Crossref, Google Scholar
• Roth AE, Peranson E (1999) The redesign of the matching market for American physicians: Some engineering aspects of economic design. Amer. Econom. Rev. 89(4):748–780.Crossref, Google Scholar
• Roth AE, Sönmez T, Ünever MU (2004) Kidney exchange. Quart. J. Econom. 119(2):457–488.Crossref, Google Scholar
• Roth AE, Sönmez T, Ünever MU (2005) Pairwise kidney exchange. J. Econom. Theory 125(2):151–188.Crossref, Google Scholar
• Rubinstein A (2014) Inapproximability of Nash equilibrium. Working paper, University of California, Berkeley, Berkeley.Google Scholar
• Sandholm T (2007) Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions. AI Magazine 28(3):45–58.Google Scholar
• Sandholm T, Boutilier C (2006) Preference elicitation in combinatorial auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 233–263.Google Scholar
• Sönmez T, Ünver MU (2010) Course budding at business schools. Internat. Econom. Rev. 51(1):99–123.Crossref, Google Scholar
• Sun XH, Rover DT (1994) Scalability of parallel algorithm-machine combinations. IEEE Trans. Parallel Distributed Systems 5(6):599–613.Crossref, Google Scholar
• Vazirani VV, Yannakakis M (2011) Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM 58(3):10.Crossref, Google Scholar
• Watson JP, Beck J, Howe AE, Whitley L (2003) Problem difficulty for tabu search in job-shop scheduling. Artificial Intelligence 143(2):189–217.Crossref, Google Scholar