Take-it-or-leave-it contracts in many-to-many matching markets

被引:0
|
作者
Antonio Romero-Medina
Matteo Triossi
机构
[1] Universidad Carlos III de Madrid,Department of Economics
[2] Ca’ Foscari University of Venice,Department of Management
来源
Economic Theory | 2023年 / 75卷
关键词
Contracts; Many-to-many; Sequential; Take-it-or-leave-it; C72; D72; D78;
D O I
暂无
中图分类号
学科分类号
摘要
We study a class of sequential non-revelation mechanisms in which hospitals make simultaneous take-it-or-leave-it offers to doctors. We prove that all pure strategy subgame perfect Nash equilibrium outcomes are stable, but the inclusion of contracts shrinks the set of equilibrium outcomes. Our analysis reveals the existence of an advantage in setting the terms of the relationship that is absent from the model without contracts. The mechanisms of this class are outcome equivalent and implement the set of stable allocations in subgame perfect Nash equilibrium when competitive rivalry is present. The equilibrium outcomes form a lattice when preferences are substitutable.
引用
收藏
页码:591 / 623
页数:32
相关论文
共 50 条
  • [41] The stability of many-to-many matching with max-min preferences
    Jiao, Zhenhua
    Tian, Guoqiang
    ECONOMICS LETTERS, 2015, 129 : 52 - 56
  • [42] A Many-to-One Algorithm to Solve a Many-to-Many Matching Problem for Routing
    Guo, Wenjing
    van Blokland, Wouter Beelaerts
    Negenborn, Rudy R.
    COMPUTATIONAL LOGISTICS (ICCL 2018), 2018, 11184 : 279 - 294
  • [43] Binary Operations for the Lattice Structure in a Many-to-Many Matching Model
    Paola Belén Manasero
    Journal of the Operations Research Society of China, 2021, 9 : 207 - 228
  • [44] Many-to-Many Matching under the l1 Norm
    Demirci, M. Fatih
    Osmanlioglu, Yusuf
    IMAGE ANALYSIS AND PROCESSING - ICIAP 2009, PROCEEDINGS, 2009, 5716 : 787 - 796
  • [45] MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison
    Kpodjedo, Segla
    Ricca, Filippo
    Galinier, Philippe
    Antoniol, Giuliano
    Gueheneuc, Yann-Gael
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2013, 39 (08) : 1090 - 1111
  • [46] Binary Operations for the Lattice Structure in a Many-to-Many Matching Model
    Manasero, Paola Belen
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (01) : 207 - 228
  • [47] Finding a minimum-regret many-to-many Stable Matching
    Eirinakis, Pavlos
    Magos, Dimitrios
    Mourtos, Ioannis
    Miliotis, Panayiotis
    OPTIMIZATION, 2013, 62 (08) : 1007 - 1018
  • [48] Many-to-Many Matching With Externalities for Device-to-Device Communications
    Zhao, Jingjing
    Liu, Yuanwei
    Chai, Kok Keong
    Chen, Yue
    Elkashlan, Maged
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (01) : 138 - 141
  • [49] Many-to-many matching based task allocation for dispersed computing
    Hongwen Hui
    Fuhong Lin
    Lei Meng
    Lei Yang
    Xianwei Zhou
    Computing, 2023, 105 : 1497 - 1522
  • [50] Many-to-many matching based task allocation for dispersed computing
    Hui, Hongwen
    Lin, Fuhong
    Meng, Lei
    Yang, Lei
    Zhou, Xianwei
    COMPUTING, 2023, 105 (07) : 1497 - 1522