{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:48:28Z","timestamp":1772714908245,"version":"3.50.1"},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T00:00:00Z","timestamp":1430870400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p>We investigate the issues of existence and efficiency of lookahead equilibria in congestion games. Lookahead equilibria, whose study has been initiated by Mirrokni<jats:italic>et al.<\/jats:italic>(2012), correspond to the natural extension of pure Nash equilibria in which the players, when making use of global information in order to predict subsequent reactions of the other ones, have computationally limited capabilities.<\/jats:p>","DOI":"10.1017\/s0960129515000079","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T13:17:31Z","timestamp":1430918251000},"page":"197-214","source":"Crossref","is-referenced-by-count":3,"title":["On lookahead equilibria in congestion games"],"prefix":"10.1017","volume":"27","author":[{"given":"VITTORIO","family":"BIL\u00d2","sequence":"first","affiliation":[]},{"given":"ANGELO","family":"FANELLI","sequence":"additional","affiliation":[]},{"given":"LUCA","family":"MOSCARDELLI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,5,6]]},"reference":[{"key":"S0960129515000079_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9529-1"},{"key":"S0960129515000079_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"S0960129515000079_ref12","first-page":"251","article-title":"A theoretical examination of practical game playing: Lookahead search","author":"Mirrokni","year":"2012","journal-title":"SAGT"},{"key":"S0960129515000079_ref9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/1060590.1060600","article-title":"The price of anarchy of finite congestion games","author":"Christodoulou","year":"2005","journal-title":"STOC"},{"key":"S0960129515000079_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/090748986"},{"key":"S0960129515000079_ref15","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"S0960129515000079_ref4","first-page":"215","article-title":"A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games","author":"Bil\u00f2","year":"2012","journal-title":"WAOA"},{"key":"S0960129515000079_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2629666"},{"key":"S0960129515000079_ref17","doi-asserted-by":"publisher","DOI":"10.1080\/14786445008521796"},{"key":"S0960129515000079_ref13","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"S0960129515000079_ref2","first-page":"264","article-title":"Fast convergence to nearly optimal solutions in potential games","author":"Awerbuch","year":"2008","journal-title":"EC"},{"key":"S0960129515000079_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229169"},{"key":"S0960129515000079_ref7","first-page":"532","article-title":"Efficient computation of approximate pure Nash equilibria in congestion games","author":"Caragiannis","year":"2011","journal-title":"FOCS"},{"key":"S0960129515000079_ref5","first-page":"54","article-title":"On lookahead equilibria in congestion games","author":"Bil\u00f2","year":"2013","journal-title":"WINE"},{"key":"S0960129515000079_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.05.004"},{"key":"S0960129515000079_ref14","volume-title":"A Course in Game Theory","author":"Osborne","year":"1994"},{"key":"S0960129515000079_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0145-5"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129515000079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:10:06Z","timestamp":1691640606000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129515000079\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["S0960129515000079"],"URL":"https:\/\/doi.org\/10.1017\/s0960129515000079","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,6]]}}}