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 条
  • [21] Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal
    Segal-Halevi, Erel
    Hassidim, Avinatan
    Aumann, Yonatan
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
  • [22] Waste Makes Haste: Bounded Time Protocols for Envy-Free Cake Cutting with Free Disposal
    Segal-Halevi, Erel
    Hassidim, Avinatan
    Aumann, Yonatan
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 901 - 908
  • [23] MATCHINGS IN THE PARTITION LATTICE
    CANFIELD, ER
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (01) : 100 - 109
  • [24] Envy-free two-player m-cake and three-player two-cake divisions
    Lebert, Nicolas
    Meunier, Frederic
    Carbonneaux, Quentin
    OPERATIONS RESEARCH LETTERS, 2013, 41 (06) : 607 - 610
  • [25] The lattice of worker-quasi-stable matchings
    Bonifacio, Agustin G.
    Guinazu, Nadia
    Juarez, Noelia
    Neme, Pablo
    Oviedo, Jorge
    GAMES AND ECONOMIC BEHAVIOR, 2022, 135 : 188 - 200
  • [26] On the Allocation of Possible EU Total Allowable Catches (TAC) for the Mediterranean Swordfish: An Envy-Free Criterion and Equitable Procedure
    Kampas, Athanasios
    JOURNAL OF AGRICULTURAL ECONOMICS, 2015, 66 (01) : 170 - 191
  • [27] On the lattice structure of the set of stable matchings for a many-to-one model
    Martínez, R
    Massó, J
    Neme, A
    Oviedo, J
    OPTIMIZATION, 2001, 50 (5-6) : 439 - 457
  • [28] ALTERNATING CYCLE-FREE MATCHINGS
    MULLER, H
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1990, 7 (01): : 11 - 21
  • [29] On preferences over subsets and the lattice structure of stable matchings
    Alkan A.
    Review of Economic Design, 2001, 6 (1) : 99 - 111
  • [30] Parameterized Complexity of Conflict-Free Matchings and Paths
    Akanksha Agrawal
    Pallavi Jain
    Lawqueen Kanesh
    Saket Saurabh
    Algorithmica, 2020, 82 : 1939 - 1965
12345