New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets
We study the structure of EG, the class of Eisenberg-Gale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial 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 [JV]: 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 [JV]; whereas they use the primal-dual schema, we use a carefully constructed binary search.
KeywordsPolynomial Time Equilibrium Price Polynomial Time Algorithm Binary Search Polynomial Algorithm
Unable to display preview. Download preview PDF.
- [CDV]Chakrabarty, D., Devanur, N., Vazirani, V.V.: Eisenberg-gale markets: Rationality, strongly polynomial time solvability and competition monotonicity (manuscript), Available from: http://www.cc.gatech.edu/~nikhil/
- [DPS02]Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: Proceedings of ACM Symposium on Theory of Computing (2002)Google Scholar
- [FF56]Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics, 99–404 (1956)Google Scholar
- [GJTV05]Garg, D., Jain, K., Talwar, K., Vazirani, V.: A primal-dual algorithm for computing Fisher equilibrium in absence of gross substitutability property. In: Proceedings of wine (2005)Google Scholar
- [GVY94]Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487–498. Springer, Heidelberg (1994)Google Scholar
- [JV]Jain, K., Vazirani, V.V.: Combinatorial solvability in resource allocation markets, with applications to efficiency and fairness (manuscript, 2005), Available from: http://www.cc.gatech.edu/~vazirani/