The lattice of envy-free matchings

被引：29
|
作者：
Wu, Qingyun [1 ]
Roth, Alvin E. [2 ]
机构：
[1] Stanford Univ, Dept Management Sci & Engn, Dept Econ, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Econ, Stanford, CA 94305 USA
来源：
GAMES AND ECONOMIC BEHAVIOR | 2018年 / 109卷
基金：
美国国家科学基金会;
关键词：
Matching; Envy-free; Lattice; Vacancy chain; COLLEGE ADMISSIONS; STABLE MARRIAGES; SCHOOL CHOICE; STABILITY; PROPERTY; MARKETS; EXISTENCE;
D O I：
10.1016/j.geb.2017.12.016
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In a many-to-one matching model, we show that the set of envy-free matchings is a lattice. A Tarski operator on this lattice, which can be interpreted as modeling vacancy chains, has the set of stable matchings as its fixed points. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：201 / 211
页数：11
相关论文
共 50 条
  • [1] The lattice of envy-free many-to-many matchings with contracts
    Bonifacio, Agustin G.
    Guinazu, Nadia
    Juarez, Noelia
    Neme, Pablo
    Oviedo, Jorge
    THEORY AND DECISION, 2024, 96 (01) : 113 - 134
  • [2] The lattice of envy-free many-to-many matchings with contracts
    Agustin G. Bonifacio
    Nadia Guiñazú
    Noelia Juarez
    Pablo Neme
    Jorge Oviedo
    Theory and Decision, 2024, 96 : 113 - 134
  • [3] Envy-Free Matchings with Lower Quotas
    Yokoi, Yu
    ALGORITHMICA, 2020, 82 (02) : 188 - 211
  • [4] Envy-free matchings with one-sided preferences and matroid constraints
    Kamiyama, Naoyuki
    OPERATIONS RESEARCH LETTERS, 2021, 49 (05) : 790 - 794
  • [5] Envy-Free Division of Land
    Segal-Halevi, Erel
    Nitzan, Shmuel
    Hassidim, Avinatan
    Aumann, Yonatan
    MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (03) : 896 - 922
  • [6] ENVY-FREE MAKESPAN APPROXIMATION
    Cohen, Edith
    Feldman, Michal
    Fiat, Amos
    Kaplan, Haim
    Olonetsky, Svetlana
    SIAM JOURNAL ON COMPUTING, 2012, 41 (01) : 12 - 25
  • [7] Reforming an Envy-Free Matching
    Ito, Takehiro
    Iwamasa, Yuni
    Kakimura, Naonori
    Kamiyama, Naoyuki
    Kobayashi, Yusuke
    Nozaki, Yuta
    Okamoto, Yoshio
    Ozeki, Kenta
    ALGORITHMICA, 2025, : 594 - 620
  • [8] Minimal envy and popular matchings
    Kondratev, Aleksei Y.
    Nesterov, Alexander S.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 296 (03) : 776 - 787
  • [9] The envy-free matching problem with pairwise preferences
    Kamiyama, Naoyuki
    INFORMATION PROCESSING LETTERS, 2021, 172
  • [10] On the existence of Pareto Efficient and envy-free allocations
    Cole, Richard
    Tao, Yixin
    JOURNAL OF ECONOMIC THEORY, 2021, 193
12345