Fetching the paper…
Reading the bibliography…
We study the problem of fair allocation of a set of indivisible items among agents with additive valuations, under cardinality constraints.
Garg, J., Taki, S.: An Improved Approximation Algorithm for Maximin Shares. In: Proceedings of the 21st ACM Conference on Economics and Computation. pp. 379–380. EC ’20, Association for Computing Machinery, New York, NY, USA (Jul 2020). https://doi.org/10.1145/3391403.3399526, https://doi.org/10.1145/3391403.3399526 , arXiv: 1903.00029
1903
Earlier work this paper cites.
1997
Earlier work this paper cites.
Budish, E.: The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. Journal of Political Economy 119
2011
Earlier work this paper cites.
Ferraioli, D., Gourvès, L., Monnot, J.: On Regular and Approximately Fair Allocations of Indivisible Goods. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. pp. 997–1004. AAMAS ’14, International Foundation for Autonomous Agents and Multiagent Systems, Paris, France (2014). https://doi.org/10.5555/2615731.2617405
2014
Earlier work this paper cites.
Gourvès, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the Twenty-first European Conference on Artificial Intelligence. pp. 393–398. ECAI’14, IOS Press, Prague, Czech Republic (Aug 2014)
2014
Earlier work this paper cites.
Procaccia, A.D., Wang, J.: Fair Enough: Guaranteeing Approximate Maximin Shares. In: Proceedings of the fifteenth ACM conference on Economics and computation. pp. 675–692. EC ’14, Association for Computing Machinery, Palo Alto, California, USA (Jun 2014). https://doi.org/10.1145/2600057.2602835, https://doi.org/10.1145/2600057.2602835
2014
Earlier work this paper cites.
Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair Allocation of Indivisible Goods. In: Handbook of Computational Social Choice, pp. 285–310. Cambridge University Press, 32 Avenue of the Americas, New York, NY 10013-2473, USA, 1 edn. (2016), https://www.cambridge.org/no/academic/subjects/computer-science/artificial-intelligence-and-natural-language-processing/handbook-computational-social-choice?format=HB&isbn=9781107060432
2016
Earlier work this paper cites.
Bouveret, S., Lemaître, M.c.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems 30
2016
Earlier work this paper cites.
Kurokawa, D., Procaccia, A.D., Wang, J.: When can the maximin share guarantee be guaranteed? In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. pp. 523–529. AAAI’16, AAAI Press, Phoenix, Arizona (Feb 2016)
2016
Earlier work this paper cites.
Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation Algorithms for Computing Maximin Share Allocations. ACM Transactions on Algorithms 13
2017
Earlier work this paper cites.
Barman, S., Krishna Murthy, S.K.: Approximation Algorithms for Maximin Fair Division. In: Proceedings of the 2017 ACM Conference on Economics and Computation. pp. 647–664. EC ’17, Association for Computing Machinery, Cambridge, Massachusetts, USA (Jun 2017). https://doi.org/10.1145/3033274.3085136, https://doi.org/10.1145/3033274.3085136
2017
Cited alongside, same era.
Bouveret, S., Cechlárová, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. pp. 135–141. International Joint Conferences on Artificial Intelligence Organization, Melbourne, Australia (Aug 2017). https://doi.org/10.24963/ijcai.2017/20, https://www.ijcai.org/proceedings/2017/20
2017
Cited alongside, same era.
Bilò, V., Caragiannis, I., Flammini, M.c., Igarashi, A., Monaco, G., Peters, D., Vinci, C., Zwicker, W.S.: Almost Envy-Free Allocations with Connected Bundles. In: Blum, A. (ed.) 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 124, pp. 14:1–14:21. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https://doi.org/10.4230/LIPIcs.ITCS.2019.14, http://drops.dagstuhl.de/opus/volltexte/2018/10107 , iSSN: 1868-8969
Chiarelli, N., Krnc, M., Milanič, M., Pferschy, U., Pivač, N., Schauer, J.: Fair packing of independent sets. In: Combinatorial Algorithms. pp. 154–165. Lecture Notes in Computer Science, Springer International Publishing, Cham (2020). https://doi.org/10.1007/978-3-030-48966-3_12
2020
Later among the works it cites.
Greco, G., Scarcello, F.: The Complexity of Computing Maximin Share Allocations on Graphs. Proceedings of the AAAI Conference on Artificial Intelligence 34
2020
Later among the works it cites.
Aigner-Horev, E., Segal-Halevi, E.: Envy-free matchings in bipartite graphs and their applications to fair division. Information Sciences 587
2021
Closest in time.
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
Biswas, A., Barman, S.: Fair Division Under Cardinality Constraints. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp. 91–97. International Joint Conferences on Artificial Intelligence Organization, Stockholm, Sweden (Jul 2018). https://doi.org/10.24963/ijcai.2018/13, https://www.ijcai.org/proceedings/2018/13
2018
Cited alongside, same era.
Garg, J., McGlaughlin, P., Taki, S.: Approximating Maximin Share Allocations. In: Fineman, J.T., Mitzenmacher, M. (eds.) 2nd Symposium on Simplicity in Algorithms (SOSA 2019). OpenAccess Series in Informatics (OASIcs), vol. 69, pp. 20:1–20:11. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https://doi.org/10.4230/OASIcs.SOSA.2019.20, http://drops.dagstuhl.de/opus/volltexte/2018/10046
2018
Cited alongside, same era.
Ghodsi, M., Hajiaghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair Allocation of Indivisible Goods: Improvements and Generalizations. In: Proceedings of the 2018 ACM Conference on Economics and Computation. pp. 539–556. EC ’18, Association for Computing Machinery, Ithaca, NY, USA (Jun 2018). https://doi.org/10.1145/3219166.3219238, https://doi.org/10.1145/3219166.3219238
2018
Cited alongside, same era.
Gourvès, L., Monnot, J.: On maximin share allocations in matroids. Theoretical Computer Science 754
2018
Cited alongside, same era.
Kurokawa, D., Procaccia, A.D., Wang, J.: Fair Enough: Guaranteeing Approximate Maximin Shares. Journal of the ACM 65
2018
Cited alongside, same era.
Lonc, Z., Truszczynski, M.: Maximin Share Allocations on Cycles. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18. pp. 410–416. International Joint Conferences on Artificial Intelligence Organization (2018). https://doi.org/10.24963/ijcai.2018/57, https://doi.org/10.24963/ijcai.2018/57
2018
Cited alongside, same era.
Babaioff, M., Nisan, N., Talgam-Cohen, I.: Competitive Equilibrium with Indivisible Goods and Generic Budgets. Mathematics of Operations Research 46
2020
Cited alongside, same era.
Hummel, H., Hetland, M.L.: Fair allocation of conflicting items. Autonomous Agents and Multi-Agent Systems 36
2021
Closest in time.
Li, Z., Vetta, A.: The Fair Division of Hereditary Set Systems. ACM Transactions on Economics and Computation 9
2021
Closest in time.
Suksompong, W.: Constraints in fair division. ACM SIGecom Exchanges 19
2021
Closest in time.
Hummel, H., Hetland, M.L.: Guaranteeing half-maximin shares under cardinality constraints. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. pp. 1633–1635. AAMAS ’22, International Foundation for Autonomous Agents and Multiagent Systems (2022)
2022
Closest in time.