970 likes | 1.11k Vues
This work delves into the intricacies of equilibrium computation within market settings, specifically focusing on the Arrow-Debreu model involving multiple agents and divisible goods. The research highlights the distinct nature of equilibrium computation compared to optimization problems and presents challenges related to the computability of equilibria, particularly under piecewise-linear, concave utility functions. Additionally, the paper discusses foundational concepts, underlying algorithms, and the implications of PPAD-hardness in algorithmic game theory, aiming to enhance our understanding of market dynamics through strategic algorithms.
E N D
Dichotomies in Equilibrium Computation: Market Provide a Surprise Algorithmic Game Theoryand Internet Computing Vijay V. Vazirani Joint work with Jugal Garg & Ruta Mehta
Equilibrium computation • Has its own character, quite distinct from computability of optimization problems
Dichotomies Natural equilibrium computation problems exhibit striking
Arrow-Debreu Model • n agents and g divisible goods. • Agent i: has initial endowment of goods and a concave utility function (models satiation!)
Arrow-Debreu Model • n agents and g divisible goods. • Agent i: has initial endowment of goods and a concave utility function (piecewise-linear, concave)
Several agents with own endowments and utility functions.Currently, no goods in the market.
Equilibrium Prices p s.t. market clears, i.e., there is no deficiency or surplus of any good.
Arrow-Debreu Theorem, 1954 • Celebrated theorem in Mathematical Economics • Established existence of market equilibrium under very general conditions using a deep theorem from topology - Kakutani fixed point theorem.
Kenneth Arrow • Nobel Prize, 1972
Gerard Debreu • Nobel Prize, 1983
Arrow-Debreu Theorem, 1954 • Celebrated theorem in Mathematical Economics • Established existence of market equilibrium under very general conditions using a theorem from topology - Kakutani fixed point theorem. • Highly non-constructive!
Computability of equilibria Walras, 1874: Tanonnement process Scarf, Debreu-Mantel-Sonnenschein, 1960s: Won’t converge! Scarf, Smale, … , 1970s: Many approaches
Open problem (2002) Separable, piecewise-linear, concave (SPLC) utility functions
: piecewise-linear, concave utility amount ofj
: piecewise-linear, concave utility SPLC utility: Additively separable over goods amount ofj
Markets with separable,piecewise-linear, concave utilities • Chen, Dai, Du, Teng, 2009: • PPAD-hardness for Arrow-Debreu model • Chen & Teng, 2009: • PPAD-hardness for Fisher’s model • V. & Yannakakis, 2009: • PPAD-hardness for Fisher’s model
Markets with separable,piecewise-linear, concave utilities V. & Yannakakis, 2009: • Membership in PPAD for both models.
Markets with separable,piecewise-linear, concave utilities V. & Yannakakis, 2009: • Membership in PPAD for both models. • Indirect proof, using the class FIXP of Etessami & Yannakakis, 2008.
Open The definition of PPAD was designed to capture problems that allow for path-following algorithms, in the style of Lemke-Howson and Scarf … It will be interesting to obtain a natural, direct algorithm for this task (hence leading to a more direct proof of membership in PPAD), which may be useful for computing equilibria in practice.
Complementary Pivot Algorithms(path-following) Lemke-Howson, 1964: 2-Nash Equilibrium Eaves, 1974: Equilibrium for linear Arrow-Debreu markets (using Lemke’s algorithm)
Eaves, 1975 Technical Report: Also under study are extensions of the overall method to include piecewise-linear utilities, production, etc., if successful, this avenue could prove important in real economic modeling. Eaves, 1976 Journal Paper: ... Now suppose each trader has a piecewise-linear, concave utility function. Does there exist a rational equilibrium? Andreu Mas-Colell generated a negative example, using Leontief utilities. Consequently, one can conclude that Lemke’s algorithm cannot be used to solve this class of exchange problems.
Leontief utility (complementary goods) • Utility = min{#bread, 2 #butter} • Piecewise-linear, concave: • Equilibrium may be irrational!
Leontief utility: is non-separable PLC • Utility = min{#bread, 2 #butter} • Only bread or only butter gives 0 utility
Rationality for SPLC Utilities • Devanur & Kannan, 2007, V. & Yannakakis, 2007: Equilibrium is rational for Fisher and Arrow-Debreu models under SPLC utilities. • Using flow-based structure from DPSV.
Theorem (Garg, Mehta, Sohoni & V., 2012): • Complementary pivot (path-following) algorithm for Arrow-Debreu markets under SPLC utilities. • Membership in PPAD, using Todd, 1976. • Algorithm is simple, no stability issues, & is practical.
Experimental Results Inputs are drawn uniformly at random.
log(no. of iterations) log(total no. of segments)
Eaves, 1975 Technical Report: Also under study are extensions of the overall method to include piecewise-linear utilities, production, etc., if successful, this avenue could prove important in real economic modeling. • Main general class of markets still unresolved.
Eaves, 1975 Technical Report: Also under study are extensions of the overall method to include piecewise-linear utilities, production, etc., if successful, this avenue could prove important in real economic modeling. • Main general class of markets still unresolved. • So far, no works exploring rationality …
Garg & V., 2013: • SPLC Production: 1 finished good from 1 raw good, e.g., bread from wheat or corn. Total is additive. • LCP and complementary pivot algorithm • PPAD-complete • Rationality • Non-separable PLC Production: From 2 or more raw goods: irrational!
Separable vs non-separable • This dichotomy arises in several places, e.g., concave flows.
utility amount of crème brulee
utility amount of chocolate cake
Utilities of Crème Brulee and Chocolate Cake are not additively separable -- both satiate desire for dessert! • Joint utility should be sub-additive
Capture via non-separable utilities! • This non-separability is very different from that of Leontief utilities. • Leontief: goods are complements • Here: goods are substitutes
Garg, Mehta & V, 2013: Leontief-free utility functions • Both are subclasses of PLC utilities, with no known generalization to differentiable, concave utilities.