{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:03:06Z","timestamp":1782320586787,"version":"3.54.5"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1109\/tac.2008.2010885","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T19:46:41Z","timestamp":1234554401000},"page":"208-220","source":"Crossref","is-referenced-by-count":266,"title":["Joint Strategy Fictitious Play With Inertia for Potential Games"],"prefix":"10.1109","volume":"54","author":[{"given":"Jason R.","family":"Marden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00dcrdal","family":"Arslan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeff S.","family":"Shamma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00044-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11362"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0531(03)00106-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"ref35","author":"hart","year":"2006","journal-title":"The Communication Complexity of Uncoupled Nash Equilibrium Procedures"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/1467-937X.t01-1-00026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139173179"},{"key":"ref11","author":"weibull","year":"1995","journal-title":"Evolutionary Game Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2005.00625.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322655581"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.843878"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2004.1430262"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0178"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2951778"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0899-8256(03)00178-7"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132608"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/game.1993.1021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073868"},{"key":"ref3","author":"young","year":"2005","journal-title":"Strategic Learning and Its Limits"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"ref29","first-page":"45","article-title":"routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games","author":"blum","year":"2006","journal-title":"Proc 10th Ann ACM Symp Principles of Distributed Computing"},{"key":"ref5","author":"monderer","year":"1997","journal-title":"Fictitious Play and No-Cycling Conditions"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(91)90142-D"},{"key":"ref7","author":"ben-akiva","year":"1985","journal-title":"Discrete Choice Analysis Theory and Application to Travel Demand"},{"key":"ref2","author":"fudenberg","year":"1998","journal-title":"The Theory of Learning in Games"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214252","author":"young","year":"1998","journal-title":"Individual Strategy and Social Structure"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1583237"},{"key":"ref20","author":"sutton","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1214\/aoap\/1069786497","article-title":"convergent multiple-timescales reinforcement learning algorithms in normal form games","volume":"13","author":"leslie","year":"2003","journal-title":"Annals Appl Prob"},{"key":"ref21","author":"bertsekas","year":"1996","journal-title":"Neuro-Dynamic Programming"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.08.005"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012903437976"},{"key":"ref26","first-page":"323","article-title":"the evolution of selfish routing","author":"fischer","year":"2004","journal-title":"Proc 12th Eur Symp Algorithms (ESA'04)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2202\/1534-5971.1109"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9\/4781995\/04782013.pdf?arnumber=4782013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:44Z","timestamp":1633910384000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4782013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tac.2008.2010885","relation":{},"ISSN":["0018-9286"],"issn-type":[{"value":"0018-9286","type":"print"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}