Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Abdulkadiroġlu, A., Sönmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689–701 (1998)
2. Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37(4), 1030–1045 (2007)
3. Anshelevich, E., Bhardwaj, O., Postl, J.: Approximating optimal social choice under metric preferences. In: AAAI (2015)
4. Anshelevich, E., Sekar, S.: Blind, greedy, and random: algorithms for matching and clustering using only ordinal information. In: AAAI (2016)
5. Anshelevich, E., Sekar, S.: Truthful mechanisms for matching and clustering in an ordinal world. In: WINE (2016)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献