Author:
Babichenko Yakov,Emek Yuval,Feldman Michal,Patt-Shamir Boaz,Peretz Ron,Smorodinsky Rann
Funder
Israel Science Foundation
European Research Council
German-Israeli Foundation for Scientific Research and Development
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Abraham, D.J., Biró, P., Manlove, D.: “Almost stable” matchings in the roommates problem. In: Proceedings of Approximation and Online Algorithms, Third International Workshop (WAOA), pp. 1–14 (2005)
2. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1253–1264 (2011)
3. Ashlagi, I., Burq, M., Jaillet, P., Manshadi, V.H.: On matching and thickness in heterogeneous dynamic markets. In: Proceedings of the 2016 ACM Conference on Economics and Computation (EC), p. 765 (2016)
4. Ashlagi, I., Kanoria, Y., Leshno, J.D.: Unbalanced random matching markets: the stark effect of competition. J. Polit. Econ. 125, 69–98 (2016)
5. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 434–443 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献