Barman, S. and Krishna Murthy, S. K. (2017). Approximation algorithms for maximin fair division. In Proceedings of the 2017 ACM Conference on Economics and Computation, pages 647-664. ACM.
Barman, S. and Krishnamurthy, S. K. (2020). Approximation algorithms for maximin fair division. ACM Trans. Economics and Comput., 8(1):5:1-5:28.
Bogomolnaia, A. and Moulin, H. (2001). A new solution to the random assignment problem. J. Econ. Theory, 100(2):295-328.
Budish, E. (2011). The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061-1103.
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., and Wang, J. (2019). The unreasonable fairness of maximum nash welfare. ACM Transactions on Economics and Computation (TEAC), 7(3):12.
Dehghani, S., Farhadi, A., HajiAghayi, M., and Yami, H. (2018). Envy-free chore division for an arbitrary number of agents. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2564-2583. SIAM.
Dickerson, J. P., Goldman, J., Karp, J., Procaccia, A. D., and Sandholm, T. (2014). The computational rise and fall of fairness. In Twenty-Eighth AAAI Conference on Artificial Intelligence.
Farhadi, A., Ghodsi, M., Hajiaghayi, M. T., Lahaie, S., Pennock, D. M., Seddighin, M., Seddighin, S., and Yami, H. (2019). Fair allocation of indivisible goods to asymmetric agents. J. Artif. Intell. Res., 64:1-20.
Feige, U. (2009). On maximizing welfare when utility functions are subadditive. SIAM J. Comput., 39(1):122-142.
Feige, U., Sapir, A., and Tauber, L. (2022). A tight negative example for mms fair allocations. In Web and Internet Economics: 17th International Conference, WINE 2021, Potsdam, Germany, December 14–17, 2021, Proceedings, pages 355–372. Springer.
Feldman, M., Mauras, S., Narayan, V. V., and Ponitka, T. (2023). Breaking the envy cycle: Best-ofboth-worlds guarantees for subadditive valuations. CoRR, abs/2304.03706.
Foley, D. K. (1967). Resource allocation and the public sector. YALE ECON ESSAYS, VOL 7, NO 1, PP 45-98, SPRING 1967. 7 FIG, 13 REF.
Freeman, R., Shah, N., and Vaish, R. (2020). Best of both worlds: Ex-ante and ex-post fairness in resource allocation. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 21-22.
Garg, J. and Taki, S. (2021). An improved approximation algorithm for maximin shares. Artif. Intell., 300:103547.
Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., and Yami, H. (2018). Fair allocation of indivisible goods: Improvements and generalizations. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 539-556. ACM.
Halpern, D., Procaccia, A. D., Psomas, A., and Shah, N. (2020). Fair division with binary valuations: One rule to rule them all. In WINE 2020, Beijing, China, December 7-11, 2020, Proceedings.
Hoefer, M., Schmalhofer, M., and Varricchio, G. (2023). Best of both worlds: Agents with entitlements. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023, pages 564-572. ACM.
Kurokawa, D., Procaccia, A. D., and Wang, J. (2018). Fair enough: Guaranteeing approximate maximin shares. Journal of the ACM (JACM), 65(2):8.
Li, Z. and Vetta, A. (2018). The fair division of hereditary set systems. In WINE 2018, Oxford, UK, December 15-17, 2018, Proceedings.