Author:
Chakrabarty Deeparnab,Devanur Nikhil,Vazirani Vijay V.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
2. 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/
3. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23, 864–894 (1994)
4. Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: Proceedings of ACM Symposium on Theory of Computing (2002)
5. Elias, P., Feinstein, A., Shannon, C.E.: Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, 117–199 (1956)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献