Mechanism design for fair division-Reference-Cited by-同舟云学术

Mechanism design for fair division

Published:2013-06-16 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the fourteenth ACM conference on Electronic commerce
language:
Short-container-title:

Author:

Cole Richard¹,Gkatzelis Vasilis¹,Goel Gagan²

Affiliation:

1. New York University, New York, NY, USA

2. Google Research, New York, NY, USA

Publisher

ACM

Reference37 articles.

1. Aggarwal R. and Harper J. Winter 2000. Equity valuation in the czech voucher privatization auctions. Financial Management 77--100.

2. Andrews M. Qian L. and Stolyar A. L. 2005. Optimal utility based multi-user throughput allocation subject to throughput constraints. In INFOCOM. 2415--2424.

3. Barbanel J. 2004. The Geometry of Efficient Fair Division. Cambridge University Press.

4. Brams S. and Taylor A. 1996. Fair Division: from cake cutting to dispute resolution. Cambridge University Press Cambridge.

5. Budish E. 2010. The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. BQGT '10. ACM New York NY USA 74:1--74:1. 10.1145/1807406.1807480

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

1. Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness;Web and Internet Economics;2022

2. Sharing Economy in Electricity Spot Markets;Sharing Economy in Energy Markets;2022

3. Mechanism Design for Sharing Economy;Sharing Economy in Energy Markets;2022

4. Nash Social Welfare Approximation for Strategic Agents;Operations Research;2022-01

5. Mechanism Design without Money for Fair Allocations;IEEE/WIC/ACM International Conference on Web Intelligence;2021-12-14