2010
DOI: 10.1016/j.jet.2010.01.007
|View full text |Cite
|
Sign up to set email alerts
|

Substitutes and stability for matching with contracts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
124
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 176 publications
(126 citation statements)
references
References 38 publications
2
124
0
Order By: Relevance
“…. ., we update these sets and matchings 25 The tracking of reference matchings has no counterpart in earlier formulations of the deferred acceptance algorithms of, among many others, Gale and Shapley (1962), Roth (1984), Adachi (2000), Fleiner (2003), Echenique and Oviedo (2004), Hatfield and Milgrom (2005), Echenique and Oviedo (2006), Echenique and Yenmez (2007), Ostrovsky (2008), Kojima (2010), andBando (2014). In these papers, there is no need to track reference matchings and the deferred acceptance algorithm terminates when there are no more rejections and no new offers.…”
Section: Stable Matchingsmentioning
confidence: 99%
“…. ., we update these sets and matchings 25 The tracking of reference matchings has no counterpart in earlier formulations of the deferred acceptance algorithms of, among many others, Gale and Shapley (1962), Roth (1984), Adachi (2000), Fleiner (2003), Echenique and Oviedo (2004), Hatfield and Milgrom (2005), Echenique and Oviedo (2006), Echenique and Yenmez (2007), Ostrovsky (2008), Kojima (2010), andBando (2014). In these papers, there is no need to track reference matchings and the deferred acceptance algorithm terminates when there are no more rejections and no new offers.…”
Section: Stable Matchingsmentioning
confidence: 99%
“…For any branch b, we construct the adjusted priorities π + b as described above. 13 Throughout the paper we will assume that λq b and (1 − λ)q b as are integer values for any branch b. This is for expositional simplicity and has no impact on the analysis.…”
Section: The Usma Mechanismmentioning
confidence: 99%
“…We are also interested in the relation between unilateral substitutability introduced by Hatfield and Kojima (2010) and substitutable completability. Hatfield et al show that unilateral substitutability is a special case of observable substitutability.…”
Section: Introductionmentioning
confidence: 99%
“…In the graph "condition a → condition b" means that condition a implies condition b. Hatfield and Kojima (2010) Unilateral substitutability & IRC Kadam (2014) this paper In Section 2 we define the standard many-to-one matching with contracts model. In Section 3 we define weakly observable substitutability and weakly observable substitutability across workers and prove that they are sufficient conditions.…”
Section: Introductionmentioning
confidence: 99%