On the Existence of Competitive Equilibrium with Chores
summary
Shows that deciding whether a competitive equilibrium exists with divisible chores is NP-hard to decide existence, gives two simple sufficient conditions that guarantee existence — no subset of agents only do a strict subset of chores they own and disutility graph is disjoint union of bicliques — and proves existence under those conditions via a nested fixed-point proof (Brouwer then Kakutani), plus demonstrates a one-edge-from-biclique counterexample where equilibrium fails.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:16Allocation in the Exchange model
- 0:47Exchange Markets (Exchange Setting with Goods)
- 5:56CE in Exchange Setting with Chores
- 8:54Existence of CE in the Exchange Setting
- 15:46Preliminaries- Brouwer's Fixed Point Theorem
- 16:15Preliminaries-Kakutani's Fixed Point Theorem
- 17:25Proof of Existence-Goods Case
- 18:48Defining the Correspondence (Goods Case)
- 20:35Fixed Point to CE
- 24:06Generalizing the Approach to Chores (Problem)
- 26:47Defining the new Correspondence
- 28:02Nested Fixed Point Theorems
- 29:09Summary
- 29:50Future Directions
