{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:55Z","timestamp":1750307335086,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>\n            Often, in both computerized settings and economics settings, the prescribed behavior for participants is to repeatedly \"best respond\" to each others' actions. We aim to understand when such myopic \"local rationality\" is also \"globally rational\",\n            <jats:italic>i.e.<\/jats:italic>\n            , when is it best for a player, given that the others are repeatedly best-responding, to also repeatedly best-respond?\n          <\/jats:p>","DOI":"10.1145\/1998549.1998552","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T13:47:26Z","timestamp":1308664046000},"page":"16-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["When is it best to best-respond?"],"prefix":"10.1145","volume":"10","author":[{"given":"Noam","family":"Nisan","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem, and Google Tel Aviv"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Valiant","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aviv","family":"Zohar","sequence":"additional","affiliation":[{"name":"Microsoft Research, Silicon Valley"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993633"},{"volume-title":"ICS '11: Proceedings of the 2nd symposium on Innovations in Computer Science.","author":"Nisan N.","key":"e_1_2_1_2_1","unstructured":"Nisan , N. , Schapira , M. , Valiant , G. , and Zohar , A . 2011b. Best-response mechanisms . In ICS '11: Proceedings of the 2nd symposium on Innovations in Computer Science. Nisan, N., Schapira, M., Valiant, G., and Zohar, A. 2011b. Best-response mechanisms. In ICS '11: Proceedings of the 2nd symposium on Innovations in Computer Science."}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998549.1998552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998549.1998552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:13Z","timestamp":1750244773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998549.1998552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":2,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1145\/1998549.1998552"],"URL":"https:\/\/doi.org\/10.1145\/1998549.1998552","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2011,6]]},"assertion":[{"value":"2011-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}