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 条
  • [21] Efficient many-to-many point matching in one dimension
    Colannino, Justin
    Damian, Mirela
    Hurtado, Ferran
    Langerman, Stefan
    Meijer, Henk
    Ramaswami, Suneeta
    Souvaine, Diane
    Toussaint, Godfried
    GRAPHS AND COMBINATORICS, 2007, 23 (Suppl 1) : 169 - 178
  • [22] Efficient Many-To-Many Point Matching in One Dimension
    Justin Colannino
    Mirela Damian
    Ferran Hurtado
    Stefan Langerman
    Henk Meijer
    Suneeta Ramaswami
    Diane Souvaine
    Godfried Toussaint
    Graphs and Combinatorics, 2007, 23 : 169 - 178
  • [23] Many-to-many graph matching via metric embedding
    Keselman, Y
    Shokoufandeh, A
    Demirci, MF
    Dickinson, S
    2003 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2003, : 850 - 857
  • [24] Many-to-many matching with max-min preferences
    Hatfield, John William
    Kojima, Fuhito
    Narita, Yusuke
    DISCRETE APPLIED MATHEMATICS, 2014, 179 : 235 - 240
  • [25] Credible group stability in many-to-many matching problems
    Konishi, Hideo
    Unver, M. Utku
    JOURNAL OF ECONOMIC THEORY, 2006, 129 (01) : 57 - 80
  • [26] 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
  • [27] Many-to-Many Graph Matching: A Continuous Relaxation Approach
    Zaslavskiy, Mikhail
    Bach, Francis
    Vert, Jean-Philippe
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT III, 2010, 6323 : 515 - 530
  • [28] Role of common preferences in the outcome of many-to-many matching
    Lee, Joonbae
    ECONOMICS LETTERS, 2022, 217
  • [29] Many-to-Many Matching in l1 Norm
    Demirci, M. Fatih
    2008 IEEE 16TH SIGNAL PROCESSING, COMMUNICATION AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2008, : 144 - 147
  • [30] Bit error probability of an associative memory with many-to-many correspondence
    Tanaka, T
    NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1996, 7 (03) : 573 - 586
12345