Author:
Mishra Shaily,Padala Manisha,Gujar Sujit
Publisher
Springer Nature Switzerland
Reference41 articles.
1. Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algor. (TALG) 13(4), 1–28 (2017)
2. Aziz, H., Caragiannis, I., Igarashi, A.: Fair allocation of combinations of indivisible goods and chores. CoRR abs/1807.10684 (2018). http://arxiv.org/abs/1807.10684
3. Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: Computing fair utilitarian allocations of indivisible goods. CoRR abs/2012.03979 (2020), https://arxiv.org/abs/2012.03979
4. Aziz, H., Moulin, H., Sandomirskiy, F.: A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5), 573–578 (2020)
5. Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores, pp. 335–341. AAAI 2017, AAAI Press (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献