{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:02:46Z","timestamp":1775145766070,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662533536","type":"print"},{"value":"9783662533543","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_4","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"40-51","source":"Crossref","is-referenced-by-count":37,"title":["Complexity and Optimality of the Best Response Algorithm in Random Potential Games"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Durand","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Gaujal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"PGC Daskalakis","year":"2009","unstructured":"Daskalakis, P.G.C., Papadimitriou, C.: The complexity of computing a nash equilibrium. SIAM J. Comput. 39(3), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"4_CR3","volume-title":"Studies in the Economics of Transportation","author":"M Beckman","year":"1956","unstructured":"Beckman, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"5","key":"4_CR4","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi user communication networks. IEEE\/ACM Trans. Netw. 1(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"4_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","volume":"25","author":"RG Gallager","year":"1977","unstructured":"Gallager, R.G.: A minimum delay routing algorithm using distributed computation. IEEE Trans. Commun. 25(1), 73\u201385 (1977)","journal-title":"IEEE Trans. Commun."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Wardrop, J.: Some theoretical aspects of road traffic research, part ii. In: Proceedings of the Institute of Civil Engineers, vol. 1, pp. 325\u2013378 (1954)","DOI":"10.1680\/ipeds.1952.11259"},{"key":"4_CR7","volume-title":"Selfish Routing and the Price of Anarchy","author":"T Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, ser. (STOC 2004), pp. 604\u2013612. ACM (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: FOCS 2006, pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"38","author":"J Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person game. Proc. Nat. Acad. Sci. 38, 48\u201349 (1950)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games Econ. Behav. 14(1), 124\u2013143 (1996). Elsevier","journal-title":"Games Econ. Behav."},{"key":"4_CR12","unstructured":"Babichenko, Y., Tamuz, O.: Graphical potential games. arXiv.org, Tech. Rep.: 1405.1481v2"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"E Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719. Springer, Heidelberg (2003)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/978-3-642-35311-6_38","volume-title":"Internet and Network Economics","author":"M Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Convergence of best-response dynamics in games with conflicting congestion effects. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 496\u2013503. Springer, Heidelberg (2012)"},{"issue":"4","key":"4_CR15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/rsa.20199","volume":"31","author":"B Imre","year":"2007","unstructured":"Imre, B., Vempala, S., Vetta, A.: Nash equilibria in random games. Random Structures Algorithms 31(4), 391\u2013405 (2007)","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"4_CR16","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1006\/game.1999.0775","volume":"33","author":"Y Rinott","year":"2000","unstructured":"Rinott, Y., Scarsini, M.: On the number of pure strategy nash equilibria in random games. Games Econ. Behav. 33(2), 274\u2013293 (2000)","journal-title":"Games Econ. Behav."},{"key":"4_CR17","unstructured":"Durand, S., Gaujal, B.: Complexity, optimality of the best response algorithm in random potential games. Inria, Research Report RR-8925 (2016). https:\/\/hal.inria.fr\/hal-01330805"},{"issue":"3","key":"4_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0165-1765(99)00196-2","volume":"66","author":"M Voorneveld","year":"2000","unstructured":"Voorneveld, M.: Best-response potential games. Econ. Lett. 66(3), 289\u2013295 (2000)","journal-title":"Econ. Lett."},{"key":"4_CR19","series-title":"Series in Probability and Statistics","volume-title":"Comparison Methods for Stochastic Models and Risks","author":"A M\u00fcller","year":"2002","unstructured":"M\u00fcller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Series in Probability and Statistics. Wiley, Chichester (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T05:54:07Z","timestamp":1568354047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}