{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:40:22Z","timestamp":1763642422970,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tac.2018.2847602","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T18:47:35Z","timestamp":1529002055000},"page":"1288-1294","source":"Crossref","is-referenced-by-count":13,"title":["Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0188-3346","authenticated-orcid":false,"given":"Antonio","family":"Pietrabissa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3809-8886","authenticated-orcid":false,"given":"Lorenzo","family":"Ricciardi Celsi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.07.021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MED.2016.7535946"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00446-010-0125-1","article-title":"Distributed algorithms for QoS load balancing","volume":"23","author":"ackermann","year":"2010","journal-title":"Distrib Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2584979"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65479-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2010.06.029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209951"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1368436.1368438"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.06.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.805812"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2011.07.005"},{"key":"ref18","first-page":"1","article-title":"A decentralized load balancing algorithm for heterogeneous wireless access networks","author":"oddi","year":"0","journal-title":"Proc World Telecommun Congr"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-85194-3_5","article-title":"Distributed learning of Wardrop equilibria","volume":"5204","author":"barth","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"ref28","article-title":"Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games","author":"blum","year":"0","journal-title":"Proc 25th Annu ACM Symp Princ Distrib Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/050639272"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/090746720"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150303"},{"key":"ref29","first-page":"163","article-title":"On the convergence of no-regret learning in selfish routing","volume":"32","author":"krichene","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2367361"},{"journal-title":"Population Games and Evolutionary Dynamics","year":"2010","author":"sandholm","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2008.08.006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms0962"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.10.012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11362"},{"journal-title":"Studies in the Economics of Transportation","year":"1959","author":"beckmann","key":"ref20"},{"key":"ref22","first-page":"1","article-title":"Reaching approximate Wardrop equilibrium at reduced costs of link state updates","author":"lee","year":"0","journal-title":"Proc Int Conf Commun Syst Netw"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3934\/nhm.2009.4.605"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0057-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209975"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.809145"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.055"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8653438\/08385204.pdf?arnumber=8385204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:25Z","timestamp":1657746505000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8385204\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tac.2018.2847602","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"type":"print","value":"0018-9286"},{"type":"electronic","value":"1558-2523"},{"type":"electronic","value":"2334-3303"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}