Author:
Benabbou Nawal,Chakraborty Mithun,Igarashi Ayumi,Zick Yair
Publisher
Springer International Publishing
Reference34 articles.
1. Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite B-matching. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 35–41 (2017)
2. Aziz, H., Gaspers, S., Sun, Z., Walsh, T.: From matching with diversity constraints to matching with regional quotas. In: Proceedings of the 18th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 377–385 (2019)
3. Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. CoRR abs/1907.09279 (2019)
4. Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Proceedings of the 10th Conference on Web and Internet Economics (WINE), pp. 1–14 (2014)
5. Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. CoRR abs/2002.10704 (2020)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Class fairness in online matching;Artificial Intelligence;2024-10
2. Fair Division via Quantile Shares;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Envy-free relaxations for goods, chores, and mixed items;Theoretical Computer Science;2024-06
4. Guaranteeing Envy-Freeness under Generalized Assignment Constraints;Proceedings of the 24th ACM Conference on Economics and Computation;2023-07-07
5. Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations;Web and Internet Economics;2022