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 条
  • [31] On Social Envy-Freeness in Multi-Unit Markets
    Flammini, Michele
    Mauro, Manuel
    Tonelli, Matteo
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 1031 - 1038
  • [32] Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
    Farhadi, Alireza
    Hajiaghayi, MohammadTaghi
    Latifian, Mohamad
    Seddighin, Masoud
    Yami, Hadi
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5355 - 5362
  • [33] Ex ante and ex post envy-freeness on polytope resources
    Sano, Yoshio
    Zhan, Ping
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2024,
  • [34] Ex ante and ex post envy-freeness on polytope resourcesEx ante and ex post envy-freeness on polytope resourcesY. Sano, P. Zhan
    Yoshio Sano
    Ping Zhan
    Japan Journal of Industrial and Applied Mathematics, 2025, 42 (1) : 177 - 196
  • [35] Bidding for envy-freeness: A procedural approach to n-player fair-division problems
    Claus-Jochen Haake
    Matthias G. Raith
    Francis Edward Su
    Social Choice and Welfare, 2002, 19 : 723 - 749
  • [36] Compatibility of egalitarian equivalence and envy-freeness in a continuum-agent economy
    Cato, Susumu
    ECONOMIC THEORY BULLETIN, 2020, 8 (01) : 97 - 103
  • [37] Bidding for envy-freeness:: A procedural approach to n-player fair-division problems
    Haake, CJ
    Raith, MG
    Su, FE
    SOCIAL CHOICE AND WELFARE, 2002, 19 (04) : 723 - 749
  • [38] Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory
    Manurangsi, Pasin
    Suksompong, Warut
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 335 - 341
  • [39] Compatibility of egalitarian equivalence and envy-freeness in a continuum-agent economy
    Susumu Cato
    Economic Theory Bulletin, 2020, 8 : 97 - 103
  • [40] Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols
    Lindner, Claudia
    Rothe, Joerg
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2009, 5929 : 149 - 159
12345