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

On the observational equivalence of random matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 40 publications
0
4
0
Order By: Relevance
“…33 In the dynamic random matching model defined in the proof of Theorem 3.1 in [19] (and of Theorem 4 here), every step of randomization uses the realized type function generated in the step of randomization immediately before. 34 As noted in Subsection 3.2 of [44], there are many non-independent random matchings with some matching properties even for finitely many agents. 35 Independence is in general viewed as a behavioral assumption.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…33 In the dynamic random matching model defined in the proof of Theorem 3.1 in [19] (and of Theorem 4 here), every step of randomization uses the realized type function generated in the step of randomization immediately before. 34 As noted in Subsection 3.2 of [44], there are many non-independent random matchings with some matching properties even for finitely many agents. 35 Independence is in general viewed as a behavioral assumption.…”
Section: Discussionmentioning
confidence: 99%
“…However, it is shown in the proof of Theorem 2.4 of [19, p. 399] that forî =ĵ inÎ, (πî,πĵ) is a measurepreserving mapping from (Ω, F, P ) to (Î ×Î,Î I,λ λ ), which implies thatπî andπĵ are independent as measurable mappings. 44 The idea of the proof of [19] can be used to show that for finitely many different agents, the mappings of their random partners are independent. This stronger independence property is shown explicitly in [47] for the particular universal random matching considered there.…”
Section: It Is Clear That ψ(Ementioning
confidence: 99%
See 1 more Smart Citation
“…In fact, even with finite population models one can easily construct matching models for which individual matching distributions are nonconstant (individual randomness) but have constant aggregate matching distributions[11]. Many distinct individual matching schemes can give exactly the same aggregate matching distribution.…”
mentioning
confidence: 99%