{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:55:15Z","timestamp":1680436515075},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1389-1286(03)00231-7","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"133-146","source":"Crossref","is-referenced-by-count":10,"title":["Avoiding paradoxes in multi-agent competitive routing"],"prefix":"10.1016","volume":"43","author":[{"given":"Eitan","family":"Altman","sequence":"first","affiliation":[]},{"given":"Rachid","family":"El Azouzi","sequence":"additional","affiliation":[]},{"given":"Odile","family":"Pourtallier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20134","key":"10.1016\/S1389-1286(03)00231-7_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0166-5316(02)00112-8","article-title":"Non-cooperative routing in loss networks","volume":"49","author":"Altman","year":"2002","journal-title":"Performance Evaluation"},{"issue":"9","key":"10.1016\/S1389-1286(03)00231-7_BIB2","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1006\/jpdc.2001.1754","article-title":"Routing into two parallel links: game-theoretic distributed algorithms","volume":"61","author":"Altman","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/3215183","article-title":"Braess\u2019s paradox in loss networks","volume":"34","author":"Bean","year":"1997","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/BF01918335","article-title":"Ber ein paradoxen aus der verkehrsplanung","volume":"12","author":"Braess","year":"1968","journal-title":"Unternehmensforschung"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.2307\/3215182","article-title":"Braess\u2019s paradox in a queuing network with state depending routing","volume":"34","author":"Calvert","year":"1997","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB6","doi-asserted-by":"crossref","first-page":"730","DOI":"10.2307\/3214558","article-title":"A paradox of congestion in a queuing network","volume":"27","author":"Cohen","year":"1990","journal-title":"Journal of Applied Probability"},{"issue":"2","key":"10.1016\/S1389-1286(03)00231-7_BIB7","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1109\/90.588114","article-title":"Congestion resulting from increased capacity in single-server queuing network","volume":"5","author":"Cohen","year":"1997","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0191-2615(84)90023-7","article-title":"On some traffic equilibrium theory paradoxes","volume":"18","author":"Dafermos","year":"1984","journal-title":"Journal of Transportation Resource B"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB9","doi-asserted-by":"crossref","unstructured":"H. Kameda, E. Altman, T. Kozawa, A case where paradox like Braess\u2019s occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium-situation of load balancing in distributed computer systems, Proceedings of IEEE CDC\u201999, Phoenix, Arizona, USA, December 1999","DOI":"10.1109\/CDC.1999.827988"},{"issue":"9","key":"10.1016\/S1389-1286(03)00231-7_BIB10","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/9.880619","article-title":"Braess-like paradoxes in distributed computer systems","volume":"45","author":"Kameda","year":"2001","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB11","series-title":"Modeling and Analysis, An Introduction to System Performance Evaluation Methodology","author":"Kobayashi","year":"1978"},{"issue":"7","key":"10.1016\/S1389-1286(03)00231-7_BIB12","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/49.414643","article-title":"Architecting non-cooperative networks","volume":"13","author":"Korilis","year":"1995","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"10.1016\/S1389-1286(03)00231-7_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/9.557575","article-title":"Capacity allocation under non-cooperative routing","volume":"42","author":"Korilis","year":"1997","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1239\/jap\/1032374242","article-title":"Avoiding the Braess paradox in non-cooperative network","volume":"36","author":"Korilis","year":"1999","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB15","unstructured":"J.L. Lutton, On link costs in networks, private communication, France Telecom"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB16","unstructured":"Y. Massuda, Braess\u2019s paradox and capacity management in decentralized network, manuscript, 1999"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB17","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/90.251910","article-title":"Competitive routing in multi-user communication network","volume":"1","author":"Orda","year":"1993","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.2307\/1911749","article-title":"Existence and uniqueness of equilibrium points for concave N-person games","volume":"33","author":"Rosen","year":"1965","journal-title":"Econometrica"},{"key":"10.1016\/S1389-1286(03)00231-7_BIB19","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0041-1647(78)90030-8","article-title":"In a road network, increasing delay locally can reduce delay globally","volume":"12","author":"Smith","year":"1978","journal-title":"Journal of Transportation Resource"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T22:21:02Z","timestamp":1553206862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603002317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1389128603002317"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00231-7","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}