630 likes | 778 Views
Market Equilibrium. Ruta Mehta. LCP and Lemke’s Scheme Linear case – Eaves (1975) SPLC case – Garg, M., Sohoni, Vazirani (2012). Linear Complementarity Problem. Examples of linear complementarity. LP: complementary slackness either a primal inequality is satisfied with equality
E N D
Market Equilibrium Ruta Mehta
LCP and Lemke’s Scheme Linear case – Eaves (1975) SPLC case – Garg, M., Sohoni, Vazirani (2012)
Examples of linear complementarity LP: complementary slackness either a primal inequality is satisfied with equality or corresponding dual variable = 0. KKT conditions for QP 2-Nash: For row player, either Pr[row i] = 0 or row i is a best response.
How to Proceed? No Potential Function!
Lemke’s Scheme Follow the path starting with the primary ray
Lemke’s Scheme Complementary Pivot Follow the path starting with the primary ray
Lemke’s Scheme Does not guarantee a solution Follow the path starting with the primary ray
Lemke’s Scheme No Secondary rays Follow the path starting with the primary ray
No secondary ray Paths pair-up rest of the solutions
amount of goodj Linear utility function utility utility/unit of j
amount of goodj Linear utility function utility utility/unit of j
LCP (Eaves, 1975) All zeros is a solution!
Recourse Recall: Equilibrium prices can be scaled.
Resulting LCP Theorem: Resulting LCP captures exactly the set of market equilibria.
No Secondary Rays Proof on board
amount ofj Segments of SPLC utility function utility/unit of j Non-satiated utility
amount ofj Segments of SPLC utility function utility/unit of j Satiated utility
In general, equilibrium may not exist. Vazirani & Yannakakis: Deciding this is NP-hard.
A weak sufficient condition • Consider graph G on A, with • Maxfield, 1997: If G is strongly connected, then the market has an equilibrium.
Assuming Strong Connectivity Chen et al. (2009): PPAD-hard VY (2009): In PPAD, Rationality GMSV (2012): LCP, No secondary rays • Computation, existence, oddness, containment in PPAD
amount ofj Segments of SPLC utility function utility/unit of j utility
Optimal bundle for i w.r.t. pricesp Sort all his segments by decreasing bpb. Partition by equality: Start allocating until money runs out.
Forced, flexible and undesirable partitions Flexible: last allocated partition Forced: all partitions before flexible Undesirable: all partitions after flexible
Forced, flexible and undesirable partitions Forced: all segments fully allocated Flexible: remaining money spent on any segments Undesirable: no segments allocated