[1] Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi. Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms, 13(4):52:1-52:28, 2017.
[2] Georgios Amanatidis, Evangelos Markakis, and Apostolos Ntokos. Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination. Theor. Comput. Sci., 841: 94-109, 2020.
[3] Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Herve Moulin, Alexandros A. Voudouris, and Xiaowei Wu. Fair division of indivisible goods: A survey. CoRR, abs/2208.08782, 2022.
[4] Haris Aziz, Gerhard Rauchhecker, Guido Schryen, and Toby Walsh. Algorithms for max-min share fair allocation of indivisible chores. In AAAI, pages 335-341. AAAI Press, 2017.
[5] Moshe Babaioff, Noam Nisan, and Inbal Talgam-Cohen. Fair allocation through competitive equilibrium from generic incomes. In FAT, page 180. ACM, 2019.
[6] Siddharth Barman and Sanath Kumar Krishnamurthy. Approximation algorithms for maximin fair division. ACM Trans. Economics and Comput., 8(1):5:1-5:28, 2020.
[7] Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, and Yadati Narahari. Groupwise maximin fair allocation of indivisible goods. In AAAI, pages 917-924. AAAI Press, 2018.
[8] Siddharth Barman, Arindam Khan, Sudarshan Shyam, and K. V. N. Sreenivas. Finding fair allocations under budget constraints. In AAAI, pages 5481-5489. AAAI Press, 2023.
[9] Siddharth Barman, Arindam Khan, Sudarshan Shyam, and K. V. N. Sreenivas. Guaranteeing envy-freeness under generalized assignment constraints. In EC, pages 242-269. ACM, 2023.
[10] Siddharth Barman, Vishnu V. Narayan, and Paritosh Verma. Fair chore division under binary supermodular costs. CoRR, abs/2302.11530, 2023.
[11] Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. On approximate envy-freeness for indivisible chores and mixed resources. In APPROX-RANDOM, volume 207 of LIPIcs, pages 1:1-1:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[12] Jeff A. Bilmes. Submodularity in machine learning and artificial intelligence. CoRR, abs/2202.00132, 2022.
[13] Sylvain Bouveret and Michel Lemaitre. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi Agent Syst., 30(2):259-290, 2016.
[14] Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061-1103, 2011.
[15] Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. The unreasonable fairness of maximum nash welfare. ACM Trans. Economics and Comput., 7(3):12:1-12:32, 2019.
[16] Hau Chan, Jing Chen, Bo Li, and Xiaowei Wu. Maximin-aware allocations of indivisible goods. In IJCAI, pages 137-143. ijcai.org, 2019.
[17] Edward G Coffman, János Cserik, Gábor Galambos, Silvano Martello, and Daniele Vigo. Bin packing approximation algorithms: survey and classification. In Handbook of combinatorial optimization, pages 455-531. 2013.
[18] Graham Cormode. Data sketching. Commun. ACM, 60(9):48-55, 2017.
[19] Amitay Dror, Michal Feldman, and Erel Segal-Halevi. On fair division under heterogeneous matroid constraints. J. Artif. Intell. Res., 76:567-611, 2023.