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 条
  • [41] Envy-free house allocation with minimum subsidy
    Choo, Davin
    Ling, Yan Hao
    Suksompong, Warut
    Teh, Nicholas
    Zhang, Jian
    [J]. OPERATIONS RESEARCH LETTERS, 2024, 54
  • [42] Almost envy-free allocations with connected bundles
    Bilo, Vittorio
    Caragiannis, Ioannis
    Flammini, Michele
    Igarashi, Ayumi
    Monaco, Gianpiero
    Peters, Dominik
    Vinci, Cosimo
    Zwicker, William S.
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2022, 131 : 197 - 221
  • [43] Maximin Envy-Free Division of Indivisible Items
    Steven J. Brams
    D. Marc Kilgour
    Christian Klamler
    [J]. Group Decision and Negotiation, 2017, 26 : 115 - 131
  • [44] A Bounded and Envy-Free Cake Cutting Algorithm
    Aziz, Haris
    Mackenzie, Simon
    [J]. COMMUNICATIONS OF THE ACM, 2020, 63 (04) : 119 - 126
  • [45] An algorithm for super envy-free cake division
    Webb, WA
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1999, 239 (01) : 175 - 179
  • [46] Maximin Envy-Free Division of Indivisible Items
    Brams, Steven J.
    Kilgour, D. Marc
    Klamler, Christian
    [J]. GROUP DECISION AND NEGOTIATION, 2017, 26 (01) : 115 - 131
  • [47] On Profit-Maximizing Envy-free Pricing
    Guruswami, Venkatesan
    Hartline, Jason D.
    Karlin, Anna R.
    Kempe, David
    Kenyon, Claire
    McSherry, Frank
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 1164 - 1173
  • [48] Fair by design: Multidimensional envy-free mechanisms
    Mu'alem, Ahuva
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2014, 88 : 29 - 46
  • [49] ENVY-FREE DIVISION USING MAPPING DEGREE
    Avvakumov, Sergey
    Karasev, Roman
    [J]. MATHEMATIKA, 2021, 67 (01) : 36 - 53
  • [50] Algorithmic Solutions for Envy-Free Cake Cutting
    Deng, Xiaotie
    Qi, Qi
    Saberi, Amin
    [J]. OPERATIONS RESEARCH, 2012, 60 (06) : 1461 - 1476
12345