1. Abdulkadiroğlu, A., Pathak, P.A., Roth, A.E.: The New York City high school match. Am. Econ. Rev. 95(2), 364–367 (2005)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
3. Ashlagi, I., Graur, A., Lo, I., Mentzer, K.: Overbooking with priority-respecting reassignment. In: Presentation at the 3rd ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization (EAAMO’23) (2023)
4. Chakaravarthy, V.T., Pandit, V., Roy, S., Sabharwal, Y.: Finding independent sets in unions of perfect graphs. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), pp. 251–259 (2010)
5. Charikar, M., Chekuri, C., Pál, M.: Sampling bounds for stochastic optimization. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 257–269 (2005)