1 of 32

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 of 32

  • Two-sided matching, e.g., school choice, job matching.
  • Primitive: agents’ behavior when faced with possible alternatives.
  • Two approaches to formulating behavior.

2/26

 

  • Specifies available alternatives and chosen ones.
  • Sufficient condition for existence of stable matching: path-independence

 

  • Gives higher values to more preferred alternatives.

rationalizes

 

3 of 32

Main result

  • Contributions.
    • Build a bridge between utility-based and choice-based approaches.
    • Enable to transfer techniques in discrete math to matching (e.g., Hafalir-Kojima-Yenmez-Yokote 2023, Fujishige-Kojima-Yokote 2024).
    • Give a recipe for checking whether stable matching exists in the target problem.

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.

4 of 32

Model

  •  

4/26

 

 

 

 

 

5 of 32

Path independence

  •  

5/26

Result (Blair 1988): If every school’s choice rule satisfies path independence, then the DA algorithm produces a stable matching.

6 of 32

Substitutability

  •  

6/26

Result (Aizerman & Malishevski 1981): A choice rule satisfies path independence if and only if it satisfies substitutability and IRC.

7 of 32

Utility function

  •  

7/26

 

Sub

IRC

 

?

Rationalize

8 of 32

Ordinal concavity

  •  

8/26

Q: why “concave”? why “ordinal”?

9 of 32

 

  •  

9/26

 

 

 

 

 

 

 

10 of 32

 

  •  

10/26

11 of 32

First main theorem

  • Proof: Omitted due to time constraints

11/26

 

12 of 32

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.

 

13 of 32

New concavity

  •  

13/26

 

 

 

14 of 32

Second main theorem

  • Proof: Omitted due to time constraint

14/26

 

15 of 32

Application: minority reserves

  • School choice: students’ merit and diversity matter.
  • Minority reserves policy: schools reserve seats for minority students.
    • Theory: Hafalir & Yenmez & Yildirim 2013.
    • Used in the real world (e.g., Chile, India).

  • Construct a utility function that embodies this policy.
    • ordinally concave and size-restricted concave.

15/26

16 of 32

Application: minority reserves

  •  

16/26

17 of 32

Application: minority reserves

  •  

17/26

 

 

 

 

 

 

 

 

18 of 32

Application: minority reserves

  •  

18/26

19 of 32

Conclusion

  • “Well-behaved” combinatorial choice rules are rationalizable by a “well-behaved” utility function
    • Substitutability of choice rule is closely related to concavity of utility function

  • May enlarge applicability
    • local optimality = global optimality
    • Fast computation

19/26

20 of 32

Appendix: How to construct orders in AM’s theorem?

  •  

20

 

 

21 of 32

Appendix: Proof of Theorem 1

  •  

21/26

 

 

 

 

 

 

 

22 of 32

 

22

 

 

 

 

 

23 of 32

 

  •  

23/26

 

24 of 32

 

  •  

24/26

 

25 of 32

 

  •  

25/26

 

 

 

12

12

11

9

11

9

4

0

 

 

 

 

 

 

 

26 of 32

 

  •  

26/26

 

 

 

 

27 of 32

 

  •  

27/26

 

 

28 of 32

 

  •  

28/26

QED.

29 of 32

Appendix: Proof of Theorem 2

  •  

29/26

 

30 of 32

 

  •  

30/26

 

31 of 32

 

  •  

31/26

32 of 32

 

  •  

32/26