Local Envy-Freeness in House Allocation Problems

被引：0
|
作者：
Beynier, Aurelie [1 ]
Chevaleyre, Yann [2 ]
Gourves, Laurent [2 ]
Lesca, Julien [2 ]
Maudet, Nicolas [1 ]
Wilczynski, Anaelle [2 ]
机构：
[1] Sorbonne Univ, CNRS, Lab Informat Paris 6, F-75005 Paris, France
[2] Univ Paris 09, PSL, CNRS, LAMSADE, Paris, France
来源：
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18) | 2018年
关键词：
Object allocation; Envy-Freeness; Complexity; Algorithms;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the fair division problem consisting in allocating one item per agent so as to avoid (or minimize) envy, in a setting where only agents connected in a given social network may experience envy. In a variant of the problem, agents themselves can be located on the network by the central authority. These problems turn out to be difficult even on very simple graph structures, but we identify several tractable cases. We further provide practical algorithms and experimental insights.
引用
下载
收藏
页码：292 / 300
页数：9
相关论文
共 50 条
  • [21] A Little Charity Guarantees Almost Envy-Freeness
    Chaudhury, Bhaskar Ray
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    Sgouritsa, Alkmini
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2658 - 2672
  • [22] A Little Charity Guarantees Almost Envy-Freeness
    Chaudhury, Bhaskar Ray
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    Sgouritsa, Alkmini
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2658 - 2672
  • [23] Competitive Auctions and Envy-Freeness for Group of Agents
    Todo, Taiki
    Iwasaki, Atsushi
    Yokoo, Makoto
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 541 - 553
  • [24] Approximate envy-freeness in graphical cake cutting
    Yuen, Sheung Man
    Suksompong, Warut
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 112 - 131
  • [25] Envy-freeness and relaxed stability: hardness and approximation algorithms
    Krishnaa, Prem
    Limaye, Girija
    Nasre, Meghana
    Nimbhorkar, Prajakta
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [26] Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
    Krishnaa, Prem
    Limaye, Girija
    Nasre, Meghana
    Nimbhorkar, Prajakta
    ALGORITHMIC GAME THEORY, SAGT 2020, 2020, 12283 : 193 - 208
  • [27] Envy-freeness in 3D hedonic games
    Mckay, Michael
    Cseh, Agnes
    Manlove, David
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2024, 38 (02)
  • [28] Envy-freeness and relaxed stability: hardness and approximation algorithms
    Prem Krishnaa
    Girija Limaye
    Meghana Nasre
    Prajakta Nimbhorkar
    Journal of Combinatorial Optimization, 2023, 45 (1)
  • [29] On social envy-freeness in multi-unit markets
    Flammini, Michele
    Mauro, Manuel
    Tonelli, Matteo
    ARTIFICIAL INTELLIGENCE, 2019, 269 : 1 - 26
  • [30] Envy-freeness and relaxed stability: hardness and approximation algorithms
    Krishnaa, Prem
    Limaye, Girija
    Nasre, Meghana
    Nimbhorkar, Prajakta
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 45 (01)
12345