Finding Fair and Efficient Allocations-Reference-Cited by-同舟云学术

Finding Fair and Efficient Allocations

Published:2018-06-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Barman Siddharth¹,Krishnamurthy Sanath Kumar²,Vaish Rohit¹

Affiliation:

1. Indian Institute of Science, Bangalore, India

2. Chennai Mathematical Institute, Kelambakkam, India

Funder

Ramanujan Fellowship

Google Travel Grant

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3219166.3219176

Reference31 articles.

1. Nima Anari Shayan Oveis Gharan Amin Saberi and Mohit Singh. 2017. Nash Social Welfare Matrix Permanent and Stable Polynomials Proceedings of the 8th Conference on Innovations in Theoretical Computer Science (ITCS). Nima Anari Shayan Oveis Gharan Amin Saberi and Mohit Singh. 2017. Nash Social Welfare Matrix Permanent and Stable Polynomials Proceedings of the 8th Conference on Innovations in Theoretical Computer Science (ITCS).

2. Siddharth Barman Sanath Kumar Krishnamurthy and Rohit Vaish. 2017. Finding Fair and Efficient Allocations. arXiv preprint arXiv:1707.04731 (2017). https://arxiv.org/abs/1707.04731 Siddharth Barman Sanath Kumar Krishnamurthy and Rohit Vaish. 2017. Finding Fair and Efficient Allocations. arXiv preprint arXiv:1707.04731 (2017). https://arxiv.org/abs/1707.04731

3. Characterizing conflicts in fair division of indivisible goods using a scale of criteria

Cited by 79 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted fair division of indivisible items: A review;Information Processing Letters;2025-01

2. Weighted Fairness Notions for Indivisible Items Revisited;ACM Transactions on Economics and Computation;2024-09-06

3. Fair division with two-sided preferences;Games and Economic Behavior;2024-09

4. A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Envy-free relaxations for goods, chores, and mixed items;Theoretical Computer Science;2024-06