New results on rationality and strongly polynomial time solvability in Eisenberg-Gale markets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4286 LNCS, Issue , 2006, Pages 239-250

  Chakrabarty, Deeparnab ^a   Devanur, Nikhil ^a   Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH; CAPACITY ALLOCATION; CONVEX PROGRAMS; DIRECTED GRAPHS; DIRECTED NETWORK; NETWORK CODING; NEW RESULTS; OPEN PROBLEMS; POLYNOMIAL-TIME; POLYTOPES; PRIMAL-DUAL; STRONGLY POLYNOMIAL ALGORITHM; TWO SOURCES;

COMBINATORIAL MATHEMATICS; INTERNET; POLYNOMIAL APPROXIMATION; WINE;

COMMERCE;

EID: 77049119232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944874_22     Document Type: Conference Paper

References (15)

1. [BV04] Stephen Boyd and Lieven Vandenberghe. Convex Optimization Cam-bridge University Press, 2004.
2. [CDV] D. Chakrabarty, N. Devanur, and V. V. Vazirani. Eisenberggale markets: Rationality, strongly polynomial time solvability and competition monotonicity. Manuscript available from http://www.cc.gatech.edu/~nikhil/.
3. +94] E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23:864-894, 1994.
4. [DPS02] Xiaotie Deng, Christos Papadimitriou, and Shmuel Safra. On the complexity of equilibria. In Proceedings of ACM Symposium on Theory of Computing, 2002.
5. [EFS56] P. Elias, A. Feinstein, and C. E. Shannon. Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, pages 117-199, 1956.
6. [EG59] E. Eisenberg and D. Gale. Consensus of subjective probabilities: the Pari-Mutuel method. The Annals of Mathematical Statistics, 30:165-168, 1959.
7. [FF56] L. R. Jr. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, pages 99-404, 1956.
8. [GJTV05] D. Garg, K. Jain, K. Talwar, and V. Vazirani. A primal-dual algorithm for computing Fisher equilibrium in absence of gross substitutability property. In Proceedings of wine, 2005.
9. [GVY94] N. Garg, V.V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proc. 21st International Colloquium on Automata, Languages, and Programming, volume 820 of Lecture Notes in Computer Science, pages 487-498. Springer-Verlag, Berlin, 1994.
10. [Hu63] T.C. Hu. Multicommodity network flows. Operations Research, 14:344-360, 1963.
11. [JV] K. Jain and V. V. Vazirani. Combinatorial solvability in resource allocation markets, with applications to efficiency and fairness. Manuscript, 2005 available from http://www.cc.gatech.edu/~vazirani/.
12. [Kel97] F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
13. [NW61] C. S. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math Soc, 36:445-450, 1961.
14. [Tar86] E. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res., 34(2):250-256, 1986.
15. [Tut61] W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math Soc, 36:221-230, 1961.