The envy-free matching problem with pairwise preferences

被引：2
|
作者：
Kamiyama, Naoyuki [1 ]
机构：
[1] Kyushu Univ, Inst Math Ind, Fukuoka, Japan
来源：
INFORMATION PROCESSING LETTERS | 2021年 / 172卷
关键词：
Matching; Envy-freeness; Pairwise preference; Algorithms;
D O I：
10.1016/j.ipl.2021.106158
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider the situation where each agent has a preference over a subset of items and exactly one item is matched to each agent. The envy-freeness of a matching guarantees that no one has envy for the others. We consider an envy-free matching in the situation where each agent has a preference that is defined based on comparisons of any two acceptable items. We prove that in this situation, the problem of checking the existence of an envy-free matching is generally hard. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：9
相关论文
共 50 条
  • [31] Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
    Bouveret, Sylvain
    Endriss, Ulle
    Lang, Jerome
    [J]. ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 387 - 392
  • [32] Envy-Free and Efficient Minimal Rights: Recursive No-Envy
    Dominguez, Diego A.
    Nicolo, Antonio
    [J]. B E JOURNAL OF THEORETICAL ECONOMICS, 2009, 9 (01):
  • [33] Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
    Huang, Chao
    Tian, Guoqiang
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2017, 105 : 1 - 8
  • [34] Optimal Envy-Free Pricing with Metric Substitutability
    Chen, Ning
    Ghosh, Arpita
    Vassilvitskii, Sergei
    [J]. EC'08: PROCEEDINGS OF THE 2008 ACM CONFERENCE ON ELECTRONIC COMMERCE, 2008, : 60 - 69
  • [35] More Fair Than Just Envy-Free
    Wierzbicki, Adam
    Ogryczak, Wlodzimierz
    [J]. COMMUNICATIONS OF THE ACM, 2013, 56 (12) : 9 - 9
  • [36] The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
    Fernandes, Cristina G.
    Ferreira, Carlos E.
    Franco, Alvaro J. P.
    Schouery, Rafael C. S.
    [J]. DISCRETE OPTIMIZATION, 2016, 22 : 141 - 161
  • [37] When Do Envy-Free Allocations Exist?
    Manurangsi, Pasin
    Suksompong, Warut
    [J]. THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2109 - 2116
  • [38] Envy-free allocations respecting social networks
    Bredereck, Robert
    Kaczmarczyk, Andrzej
    Niedermeier, Rolf
    [J]. ARTIFICIAL INTELLIGENCE, 2022, 305
  • [39] Envy-Free Sponsored Search Auctions with Budgets
    Tang, Bo
    Zhang, Jinshan
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 653 - 659
  • [40] Envy-Free Pricing with General Supply Constraints
    Im, Sungjin
    Lu, Pinyan
    Wang, Yajun
    [J]. INTERNET AND NETWORK ECONOMICS, 2010, 6484 : 483 - +
12345