Approximation Algorithms for Computing Maximin Share Allocations-Reference-Cited by-同舟云学术

Approximation Algorithms for Computing Maximin Share Allocations

Published:2015 Issue: Volume: Page:39-51
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Amanatidis Georgios,Markakis Evangelos,Nikzad Afshin,Saberi Amin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-47672-7_4

Reference19 articles.

1. Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: ACM Symposium on Theory of Computing (STOC), pp. 114–121 (2007)

2. Bansal, N., Sviridenko, M.: The santa claus problem. In: ACM Symposium on Theory of Computing (STOC), pp. 31–40 (2006)

3. Bezakova, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exchanges 5, 11–18 (2005)

4. Bouveret, S., Lang, J.: A general elicitation-free protocol for allocating indivisible goods. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 73–78 (2011)

5. Bouveret, S., Lemaître, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. In: International conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2014, pp. 1321–1328 (2014)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On picking sequences for chores;Proceedings of the 24th ACM Conference on Economics and Computation;2023-07-07

2. The Theory of Fair Allocation Under Structured Set Constraints;Ethics in Artificial Intelligence: Bias, Fairness and Beyond;2023

3. Toward Fair Recommendation in Two-sided Platforms;ACM Transactions on the Web;2022-05-31

4. Local fairness in hedonic games via individual threshold coalitions;Theoretical Computer Science;2021-07

5. Maximin share guarantee for goods with positive externalities;Social Choice and Welfare;2020-08-27