Unique stable matchings

被引:2
|
作者
Gutin, Gregory Z. [1 ]
Neary, Philip R. [2 ]
Yeo, Anders [3 ,4 ]
机构
[1] Royal Holloway Univ London, Comp Sci Dept, London, England
[2] Royal Holloway Univ London, Econ Dept, London, England
[3] Univ Southern Denmark, IMADA, Odense, Denmark
[4] Univ Johannesburg, Dept Math, Johannesburg, South Africa
关键词
Unique stable matching; Normal; -form; Acyclic preferences; Iterated deletion of unattractive alternatives; SINGLETON CORES; ALLOCATION; STABILITY; EXISTENCE; STRATEGY;
D O I
10.1016/j.geb.2023.07.010
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this paper we consider the issue of a unique prediction in one-to-one two-sided matching markets, as defined by Gale and Shapley (1962), and we prove the following:Theorem. Let P be a one-to-one two-sided matching market and let P* be its associated normal form, a (weakly) smaller matching market with the same set of stable matchings that can be obtained using procedures introduced in Irving and Leather (1986) and Balinski and Ratier (1997). The following three statements are equivalent:(a) P has a unique stable matching.(b) Preferences on P* are acyclic, as defined by Chung (2000).(c) In P* every market participant's preference list is a singleton.(c) 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).
引用
收藏
页码:529 / 547
页数:19
相关论文
共 50 条
  • [1] STABLE MATCHINGS AND STABLE PARTITIONS
    TAN, JJM
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 39 (1-2) : 11 - 20
  • [2] TRANSFORMATION FROM ARBITRARY MATCHINGS TO STABLE MATCHINGS
    TAMURA, A
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1993, 62 (02) : 310 - 323
  • [3] UNDERSTANDING POPULAR MATCHINGS VIA STABLE MATCHINGS
    Cseh, Agnes
    Faenza, Yuri
    Kavitha, Telikepalli
    Powers, Vladlena
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (01) : 188 - 213
  • [4] Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings
    Ishida, Yoshiteru
    Sato, Takumi
    17TH INTERNATIONAL CONFERENCE IN KNOWLEDGE BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS - KES2013, 2013, 22 : 672 - 679
  • [5] Random stable matchings
    Mertens, S
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2005, : 141 - 152
  • [6] Stable Noncrossing Matchings
    Ruangwises, Suthee
    Itoh, Toshiya
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 405 - 416
  • [7] On a characterization of stable matchings
    Adachi, H
    ECONOMICS LETTERS, 2000, 68 (01) : 43 - 49
  • [8] Stable Matchings in Trees
    Tayu, Satoshi
    Ueno, Shuichi
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 492 - 503
  • [9] Stable schedule matchings
    Vilmos Komornik
    Zsolt Komornik
    Christelle K. Viauroux
    Acta Mathematica Hungarica, 2012, 135 : 67 - 79
  • [10] Stable Fractional Matchings
    Caragiannis, Ioannis
    Filos-Ratsikas, Aris
    Kanellopoulos, Panagiotis
    Vaish, Rohit
    ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2019, : 21 - 39