On the correspondence of contracts to salaries in (many-to-many) matching

被引：15
|
作者：
Kominers, Scott Duke [1 ]
机构：
[1] Univ Chicago, Becker Friedman Inst Res Econ, Chicago, IL 60637 USA
来源：
GAMES AND ECONOMIC BEHAVIOR | 2012年 / 75卷 / 02期
关键词：
Many-to-many matching; Stability; Substitutes; Contract design; Unitarity; SUBSTITUTES; STABILITY;
D O I：
10.1016/j.geb.2011.12.002
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In this note, I extend the work of Echenique (2012) to show that a model of many-to-many matching with contracts may be embedded into a model of many-to-many matching with wage bargaining whenever (1) all agents' preferences are substitutable and (2) the matching with contracts model is unitary, in the sense that every contractual relationship between a given firm-worker pair is specified in a single contract. Conversely, I show that unitarity is essentially necessary for the embedding result. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码：984 / 989
页数：6
相关论文
共 50 条
  • [31] The stability of many-to-many matching with max-min preferences
    Jiao, Zhenhua
    Tian, Guoqiang
    ECONOMICS LETTERS, 2015, 129 : 52 - 56
  • [32] 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
  • [33] 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
  • [34] Many-to-Many Matching under the l1 Norm
    Demirci, M. Fatih
    Osmanlioglu, Yusuf
    IMAGE ANALYSIS AND PROCESSING - ICIAP 2009, PROCEEDINGS, 2009, 5716 : 787 - 796
  • [35] 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
  • [36] 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
  • [37] Finding a minimum-regret many-to-many Stable Matching
    Eirinakis, Pavlos
    Magos, Dimitrios
    Mourtos, Ioannis
    Miliotis, Panayiotis
    OPTIMIZATION, 2013, 62 (08) : 1007 - 1018
  • [38] 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
  • [39] On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
    Paula Jaramillo
    Çaǧatay Kayı
    Flip Klijn
    Social Choice and Welfare, 2014, 42 : 793 - 811
  • [40] On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
    Jaramillo, Paula
    Kayi, Cagatay
    Klijn, Flip
    SOCIAL CHOICE AND WELFARE, 2014, 42 (04) : 793 - 811
12345