- Aaron Clauset, Samuel Arbesman, and Daniel B Larremore. Systematic inequality and hierarchy in faculty hiring networks. Science advances, 1(1):e1400005, 2015.
Paper not yet in RePEc: Add citation now
Alvin E Roth and Elliott Peranson. The redesign of the matching market for american physicians: Some engineering aspects of economic design. American Economic Review (AER), 89(4):748–780, 1999.
Alvin E Roth. The economics of matching: Stability and incentives. Mathematics of Operations Research, 7(4): 617–628, 1982.
Alvin Roth. Repugnance as a constraint on markets. Journal of Economic Perspectives, 21(3):37–58, 2007.
- Andrew Perrault, Joanna Drummond, and Fahiem Bacchus. Strategy-proofness in the stable matching problem with couples. In International Conference on Autonomous Agents & Multiagent Systems (AAMAS), pages 132–140, 2016.
Paper not yet in RePEc: Add citation now
Atila Abdulkadiroğlu and Tayfun Sönmez. School choice: A mechanism design approach. American Economic Review (AER), 93(3):729–747, 2003.
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review (AER), 97(1):242–259, March 2007. ISSN 0002-8282.
- Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, and Henri Prade. Preferences in ai: An overview, 2011.
Paper not yet in RePEc: Add citation now
- Christian Geist and Dominik Peters. Computer-aided methods for social choice theory. Trends in Computational Social Choice, pages 249–267, 2017.
Paper not yet in RePEc: Add citation now
- Craig Boutilier, Relu Patrascu, Pascal Poupart, and Dale Schuurmans. Constraint-based optimization and utility elicitation using the minimax decision criterion. Artificial Intelligence, 170(8-9):686–713, 2006.
Paper not yet in RePEc: Add citation now
- Dan Gusfield and Robert W Irving. The stable marriage problem: structure and algorithms. MIT press, 1989.
Paper not yet in RePEc: Add citation now
David DelacreÃŒÂtaz, Scott Duke Kominers, and Alexander Teytelboym. Matching mechanisms for refugee resettlement, 2019. Working paper.
- David F Manlove, Iain McBride, and James Trimble. “almost-stable†matchings in the hospitals/residents problem with couples. Constraints, 22(1):50–72, 2017.
Paper not yet in RePEc: Add citation now
- David F Manlove, Robert W Irving, Kazuo Iwama, Shuichi Miyazaki, and Yasufumi Morita. Hard variants of stable marriage. Theoretical Computer Science, 276(1-2):261–279, 2002.
Paper not yet in RePEc: Add citation now
- David Gale and Lloyd S Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15, 1962.
Paper not yet in RePEc: Add citation now
- David Manlove. Algorithmics of matching under preferences, volume 2. World Scientific, 2013. David Manlove and Gregg O’Malley. Paired and altruistic kidney donation in the UK: Algorithms and experimentation.
Paper not yet in RePEc: Add citation now
- Diana Crane. Scientists at major and minor universities: A study of productivity and recognition. American sociological review, pages 699–714, 1965.
Paper not yet in RePEc: Add citation now
Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis. Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Operations Research (OR), 61(1):73–87, 2013.
- Esra Erdem, Muge Fidan, David Manlove, and Patrick Prosser. A general framework for stable roommates problems using answer set programming. In International Conference on Logic Programming (ICLP), 2020.
Paper not yet in RePEc: Add citation now
- Felix Brandt, Vincent Conitzer, Ulle Endriss, JeÃŒÂrôme Lang, and Ariel D Procaccia. Handbook of computational social choice. Cambridge University Press, 2016.
Paper not yet in RePEc: Add citation now
Francis Bloch and David Cantala. Markovian assignment rules. Social Choice and Welfare, 40(1):1–25, 2013.
Franz Dietrich and Christian List. Strategy-proof judgment aggregation. Economics & Philosophy, 23(3):269–300, 2007.
- J Scott Long, Paul D Allison, and Robert McGinnis. Entrance into the academic career. American sociological review, pages 816–830, 1979.
Paper not yet in RePEc: Add citation now
- Joanna Drummond, Andrew Perrault, and Fahiem Bacchus. SAT is an effective and complete method for solving stable matching problems with couples. In International Joint Conference on Artificial Intelligence (IJCAI), 2015.
Paper not yet in RePEc: Add citation now
- John P. Dickerson and Tuomas Sandholm. FutureMatch: Combining human value judgments and machine learning to match in dynamic environments. In Conference on Artificial Intelligence (AAAI), pages 622–628, 2015.
Paper not yet in RePEc: Add citation now
Joseph H Bragdon, Ali Hortaçsu, and Dan Ariely. Matching and sorting in online dating. American Economic Review (AER), 100(1):130–163, 2010.
- Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita, and David Manlove. Stable marriage with incomplete lists and ties. In International Colloquium on Automata, Languages, and Programming (ICALP), pages 443–452. Springer, 1999.
Paper not yet in RePEc: Add citation now
Maxence Delorme, Sergio GarcıÌÂa, Jacek Gondzio, Joerg Kalcsics, David Manlove, and William Pettersson. Mathematical models for stable matching problems with ties and incomplete lists. European Journal of Operational Research (EJOR), 277(2):426–441, 2019.
- Michael Sauder, Freda Lynn, and Joel M Podolny. Status: Insights from organizational sociology. Annual Review of Sociology, 38:267–283, 2012.
Paper not yet in RePEc: Add citation now
- Nick Arnosti, Ramesh Johari, and Yash Kanoria. Managing congestion in decentralized matching markets. In Conference on Economics and Computation (EC), page 451, 2014. Dorothea Baumeister, GaÃŒÂbor ErdeÃŒÂlyi, Olivia Johanna ErdeÃŒÂlyi, and Jörg Rothe. Computational aspects of manipulation and control in judgment aggregation. In International Conference on Algorithmic DecisionTheory, pages 71–85.
Paper not yet in RePEc: Add citation now
- Patrick Prosser. Stable roommates and constraint programming. In Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pages 15–28. Springer, 2014.
Paper not yet in RePEc: Add citation now
- Phebe Vayanos, Duncan McElfresh, Yingxiao Ye, John Dickerson, and Eric Rice. Active preference elicitation via adjustable robust optimization. arXiv preprint arXiv:2003.01899, 2020.
Paper not yet in RePEc: Add citation now
- Pierre Bourdieu. The forms of capital. 1986.
Paper not yet in RePEc: Add citation now
- Robert W Irving. An efficient algorithm for the stable roommates problem. Journal of Algorithms, 6(4):577–595, 1985.
Paper not yet in RePEc: Add citation now
- Robert W Irving. Stable marriage and indifference. Discrete Applied Mathematics, 48(3):261–272, 1994.
Paper not yet in RePEc: Add citation now
Sanmay Das and John N. Tsitsiklis. When is it important to know you’ve been rejected? a search problem with probabilistic appearance of offers. Journal of Economic Behavior and Organization, 74:104–122, 2010.
- Theodore Caplow and Reece Jerome McGee. The academic marketplace. Transaction Publishers, 1958.
Paper not yet in RePEc: Add citation now
- Tianhan Wang and Craig Boutilier. Incremental utility elicitation with the minimax regret decision criterion. In Ijcai, volume 3, pages 309–316, 2003.
Paper not yet in RePEc: Add citation now
- Ulle Endriss. Analysis of one-to-one matching mechanisms via SAT solving: Impossibilities for universal axioms. In Conference on Artificial Intelligence (AAAI), 2020.
Paper not yet in RePEc: Add citation now
- Val Burris. The academic caste system: Prestige hierarchies in phd exchange networks. American sociological review, 69(2):239–264, 2004.
Paper not yet in RePEc: Add citation now
- Yicheng Liu, Pingzhong Tang, and Wenyi Fang. Internally stable matchings and exchanges. In Conference on Artificial Intelligence (AAAI), 2014.
Paper not yet in RePEc: Add citation now