Envy-free matchings with one-sided preferences and matroid constraints

被引：0
|
作者：
Kamiyama, Naoyuki [1 ]
机构：
[1] Kyushu Univ, Inst Math Ind, Fukuoka, Japan
来源：
OPERATIONS RESEARCH LETTERS | 2021年 / 49卷 / 05期
关键词：
Matching; Envy-freeness; Matroid;
D O I：
10.1016/j.orl.2021.08.010
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：790 / 794
页数：5
相关论文
共 50 条
  • [1] PARETO STABLE MATCHINGS UNDER ONE-SIDED MATROID CONSTRAINTS
    Kamiyama, Naoyuki
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (03) : 1431 - 1451
  • [2] The lattice of envy-free matchings
    Wu, Qingyun
    Roth, Alvin E.
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2018, 109 : 201 - 211
  • [3] Envy-Free Matchings with Lower Quotas
    Yu Yokoi
    [J]. Algorithmica, 2020, 82 : 188 - 211
  • [4] Envy-Free Matchings with Lower Quotas
    Yokoi, Yu
    [J]. ALGORITHMICA, 2020, 82 (02) : 188 - 211
  • [5] Matchings under One-Sided Preferences with Soft Quotas
    Santhini, K. A.
    Ravi, Raghu Raman
    Nasre, Meghana
    [J]. PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2774 - 2782
  • [6] Popular Matchings with Two-Sided Preferences and One-Sided Ties
    Cseh, Agnes
    Huang, Chien-Chung
    Kavitha, Telikepalli
    [J]. Automata, Languages, and Programming, Pt I, 2015, 9134 : 367 - 379
  • [7] POPULAR MATCHINGS WITH TWO-SIDED PREFERENCES AND ONE-SIDED TIES
    Cseh, Agnes
    Huang, Chien-Chung
    Kavitha, Telikepalli
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (04) : 2348 - 2377
  • [8] The revealed preference theory of stable matchings with one-sided preferences
    Hu, Gaoji
    Li, Jiangtao
    Tang, Rui
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2020, 124 : 305 - 318
  • [9] Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
    Gopal, Kavitha
    Nasre, Meghana
    Nimbhorkar, Prajakta
    Reddy, T. Pradeep
    [J]. COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 193 - 205
  • [10] The envy-free matching problem with pairwise preferences
    Kamiyama, Naoyuki
    [J]. INFORMATION PROCESSING LETTERS, 2021, 172
12345