Sciweavers

SIAMDM
2010

Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents

13 years 7 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG) markets. We study the structure of EG(2) markets, the class of EisenbergGale markets with two agents. We prove that all markets in this class are rational, that is, they have rational equilibrium, and they admit strongly polynomial time algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a combinatorial LP. This helps resolve positively the status of two markets left as open problems by Jain and Vazirani: the capacity allocation market in a directed graph with two source-sink pairs and the network coding market in a directed network with two sources. Our algorithms for solving the corresponding nonlinear convex programs are fundamentally different from those obtained by Jain and Vazirani; whereas they use the primal-dual schema, our main tool is bi...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V.
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where SIAMDM
Authors Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
Comments (0)