Rationalizing Path-Independent Choice Rules
1/26
Isa E. Hafalir
(U. of Technology Sydney)
Koji Yokote
(U. of Tokyo)
Fuhito Kojima
(U. of Tokyo)
M. Bumin Yenmez
(Washington U.)
2/26
rationalizes
Main result
3/26
Theorem: A choice rule satisfies path independence if and only if it is rationalizable by a utility function that satisfies ordinal concavity.
Concavity notion in discrete convex analysis.
Model
4/26
Path independence
5/26
Result (Blair 1988): If every school’s choice rule satisfies path independence, then the DA algorithm produces a stable matching.
Substitutability
6/26
Result (Aizerman & Malishevski 1981): A choice rule satisfies path independence if and only if it satisfies substitutability and IRC.
Utility function
7/26
Sub
IRC
?
Rationalize
Ordinal concavity
8/26
Q: why “concave”? why “ordinal”?
9/26
| | | | |
| | | |
10/26
First main theorem
11/26
Law of aggregate demand
12/26
Result (Hatfield & Milgrom 2005): If every school’s choice rule satisfies substitutability and LAD, then DA is strategy-proof for students.
New concavity
13/26
| | | | |
| | | |
Second main theorem
14/26
Application: minority reserves
15/26
Application: minority reserves
16/26
Application: minority reserves
17/26
Application: minority reserves
18/26
Conclusion
19/26
Appendix: How to construct orders in AM’s theorem?
20
| |
| |
| |
| |
| |
| |
| |
| |
Appendix: Proof of Theorem 1
21/26
| | |
| |
| | | |
22
| |
| |
| |
| |
| |
| |
| |
| |
23/26
24/26
25/26
| |
| |
| |
| |
| |
| |
| |
| |
12 |
12 |
11 |
9 |
11 |
9 |
4 |
0 |
26/26
27/26
28/26
QED.
Appendix: Proof of Theorem 2
29/26
30/26
31/26
32/26