Nash Social Welfare Approximation for Strategic Agents-Reference-Cited by-同舟云学术

Nash Social Welfare Approximation for Strategic Agents

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

Author:

Branzei Simina¹,Gkatzelis Vasilis²,Mehta Ruta³

Affiliation:

1. Hebrew University of jerusalem, Jerusalem, Israel

2. Drexel University, Philadelphia, PA, USA

3. University of Illinois at Urbana-Champaign, Urbana, IL, USA

Funder

Israel Science Foundation

European Research Council

United States-Israel Binational Science Foundation

National Science Foundation

Publisher

ACM

Link

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

Reference63 articles.

1. B. Adsul Ch. Sobhan Babu J. Garg R. Mehta and M. Sohoni. 2010. Nash equilibria in Fisher market. In SAGT. 30--41. B. Adsul Ch. Sobhan Babu J. Garg R. Mehta and M. Sohoni. 2010. Nash equilibria in Fisher market. In SAGT. 30--41.

2. N. Anari T. Mai S. Oveis Gharan and V. V. Vazirani. 2016. Nash Social Welfare for Indivisible Items under Separable Piecewise-Linear Concave Utilities. ArXiv e-prints (Dec. 2016). arXiv:cs.GT/1612.05191 N. Anari T. Mai S. Oveis Gharan and V. V. Vazirani. 2016. Nash Social Welfare for Indivisible Items under Separable Piecewise-Linear Concave Utilities. ArXiv e-prints (Dec. 2016). arXiv:cs.GT/1612.05191

3. N. Anari S. Oveis-Gharan A. Saberi and M. Singh. 2017. Nash social welfare matrix permanent and stable polynomials. In ITCS. N. Anari S. Oveis-Gharan A. Saberi and M. Singh. 2017. Nash social welfare matrix permanent and stable polynomials. In ITCS.

4. H. Aziz and S. Mackenzie. 2016. A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents. In STOC. 10.1145/2897518.2897522 H. Aziz and S. Mackenzie. 2016. A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents. In STOC. 10.1145/2897518.2897522

5. M. Babaioff B. Lucier N. Nisan and R. Paes Leme. 2014. On the Efficiency of the Walrasian Mechanism. In EC. 783--800. 10.1145/2600057.2602850 M. Babaioff B. Lucier N. Nisan and R. Paes Leme. 2014. On the Efficiency of the Walrasian Mechanism. In EC. 783--800. 10.1145/2600057.2602850

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

1. Conflict Management in the Near-RT-RIC of Open RAN: A Game Theoretic Approach;2023 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics);2023-12-17

2. Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness;Mathematics of Operations Research;2023-11-30

3. An Equivalence Between Fair Division and Wagering Mechanisms;Management Science;2023-11-22

4. Computing welfare-Maximizing fair allocations of indivisible goods;European Journal of Operational Research;2023-06

5. Fairness-Aware Algorithms for Seed Allocation in Social Advertising;2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys);2022-12