Author:
Caragiannis Ioannis,Kaklamanis Christos,Kanellopoulos Panagiotis,Kyropoulou Maria
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference31 articles.
1. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602–1623 (2008)
2. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970–2989 (2010)
3. LNCS;Y. Aumann,2010
4. Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ’06), pp. 31–40 (2006)
5. Bateni, M., Charikar, M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ’09), pp. 543–552 (2009)
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Price of Justified Representation;ACM Transactions on Economics and Computation;2024-09-06
2. Participatory Objective Design via Preference Elicitation;The 2024 ACM Conference on Fairness, Accountability, and Transparency;2024-06-03
3. Envy-free relaxations for goods, chores, and mixed items;Theoretical Computer Science;2024-06
4. Two-Person Fair Division with Additive Valuations;Group Decision and Negotiation;2024-04-18
5. The existence and efficiency of PMMS allocations;Theoretical Computer Science;2024-03