How to Decrease the Degree of Envy in Allocations of Indivisible Goods-Reference-Cited by-同舟云学术

How to Decrease the Degree of Envy in Allocations of Indivisible Goods

Published:2013 Issue: Volume: Page:271-284
ISSN:0302-9743
Container-title:Algorithmic Decision Theory
language:
Short-container-title:

Author:

Nguyen Trung Thanh,Rothe Jörg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-41575-3_21

Reference13 articles.

1. Lecture Notes in Computer Science;C. Bazgan,1998

2. Bouveret, S., Endriss, U., Lang, J.: Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods. In: Proceedings of the 19th European Conference on Artificial Intelligence, pp. 387–392. IOS Press (August 2010)

3. Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research 32, 525–564 (2008)

4. Brams, S., Taylor, A.: An envy-free cake division protocol. The American Mathematical Monthly 102(1), 9–18 (1995)

5. Brams, S., Taylor, A.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press (1996)

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

1. Strategyproof mechanisms for 2-facility location games with minimax envy;Journal of Combinatorial Optimization;2021-02-23

2. Minimizing and Balancing Envy Among Agents Using Ordered Weighted Average;Algorithmic Decision Theory;2021

3. Strategyproof Mechanisms for 2-Facility Location Games with Minimax Envy;Algorithmic Aspects in Information and Management;2020

4. Distributed envy minimization for resource allocation;Autonomous Agents and Multi-Agent Systems;2015-02-27

5. Near Fairness in Matroids;FRONT ARTIF INTEL AP;2014