{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:59:50Z","timestamp":1794344390120,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681380","type":"print"},{"value":"9783540681410","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_22","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"239-250","source":"Crossref","is-referenced-by-count":15,"title":["New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets"],"prefix":"10.1007","author":[{"given":"Deeparnab","family":"Chakrabarty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikhil","family":"Devanur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"22_CR2","unstructured":"Chakrabarty, D., Devanur, N., Vazirani, V.V.: Eisenberg-gale markets: Rationality, strongly polynomial time solvability and competition monotonicity (manuscript), Available from: \n                  \n                    http:\/\/www.cc.gatech.edu\/~nikhil\/"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing\u00a023, 864\u2013894 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: Proceedings of ACM Symposium on Theory of Computing (2002)","DOI":"10.1145\/509907.509920"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"IT-2","author":"P. Elias","year":"1956","unstructured":"Elias, P., Feinstein, A., Shannon, C.E.: Note on maximum flow through a network. IRE Transactions on Information Theory\u00a0IT-2, 117\u2013199 (1956)","journal-title":"IRE Transactions on Information Theory"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E. Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the Pari-Mutuel method. The Annals of Mathematical Statistics\u00a030, 165\u2013168 (1959)","journal-title":"The Annals of Mathematical Statistics"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics, 99\u2013404 (1956)","DOI":"10.4153\/CJM-1956-045-5"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/11600930_4"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-58201-0_92","volume-title":"Automata, Languages, and Programming","author":"N. Garg","year":"1994","unstructured":"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.\u00a0820, pp. 487\u2013498. Springer, Heidelberg (1994)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"14","author":"T.C. Hu","year":"1963","unstructured":"Hu, T.C.: Multicommodity network flows. Operations Research\u00a014, 344\u2013360 (1963)","journal-title":"Operations Research"},{"key":"22_CR11","unstructured":"Jain, K., Vazirani, V.V.: Combinatorial solvability in resource allocation markets, with applications to efficiency and fairness (manuscript, 2005), Available from: \n                  \n                    http:\/\/www.cc.gatech.edu\/~vazirani\/"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F.P. Kelly","year":"1997","unstructured":"Kelly, F.P.: Charging and rate control for elastic traffic. European Transactions on Telecommunications\u00a08, 33\u201337 (1997)","journal-title":"European Transactions on Telecommunications"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.S.J.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res.\u00a034(2), 250\u2013256 (1986)","journal-title":"Oper. Res."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc.\u00a036, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:08:47Z","timestamp":1558271327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11944874_22","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11944874","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}