{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:02:57Z","timestamp":1760299377071},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T00:00:00Z","timestamp":1465430400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00224-016-9690-4","type":"journal-article","created":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T05:21:48Z","timestamp":1465449708000},"page":"722-746","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["When Can Limited Randomness Be Used in Repeated Games?"],"prefix":"10.1007","volume":"59","author":[{"given":"Pavel","family":"Hub\u00e1\u010dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,9]]},"reference":[{"issue":"6","key":"9690_CR1","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1111\/1468-0262.00465","volume":"71","author":"RJ Aumann","year":"2003","unstructured":"Aumann, R.J., Hart, S.: Long cheap talk. Econometrica 71(6), 1619\u20131660 (2003)","journal-title":"Econometrica"},{"key":"9690_CR2","doi-asserted-by":"crossref","unstructured":"Budinich, M., Fortnow, L.: Repeated matching pennies with limited randomness. In: Proceedings 12Th ACM conference on electronic commerce (EC-2011), pp 111\u2013118, San Jose (2011)","DOI":"10.1145\/1993574.1993592"},{"issue":"4","key":"9690_CR3","doi-asserted-by":"crossref","first-page":"905","DOI":"10.2307\/1912660","volume":"53","author":"J-P Beno\u00eet","year":"1985","unstructured":"Beno\u00eet, J.-P., Krishna, V.: Finitely repeated games. Econometrica 53(4), 905\u2013922 (1985)","journal-title":"Econometrica"},{"issue":"3","key":"9690_CR4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01756291","volume":"16","author":"J-P Beno\u00eet","year":"1987","unstructured":"Beno\u00eet, J.-P., Krishna, V.: Nash equilibria of finitely repeated games. Int. J. Game Theory 16(3), 197\u2013204 (1987)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"9690_CR5","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"9690_CR6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Advances in cryptology - CRYPTO 2000, Proceedings 20th annual international cryptology conference, pp 112\u2013130, Santa Barbara (2000)","DOI":"10.1007\/3-540-44598-6_7"},{"key":"9690_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The foundations of cryptography - volume 1, basic techniques. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"issue":"1","key":"9690_CR8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.geb.2005.03.003","volume":"55","author":"J Gonz\u00e1lez-D\u00edaz","year":"2006","unstructured":"Gonz\u00e1lez-D\u00edaz, J.: Finitely repeated games: a generalized Nash folk theorem. Games Econ. Behav. 55(1), 100\u2013111 (2006)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"9690_CR9","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9690_CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/1869086.1869101","volume":"17","author":"R Halprin","year":"2010","unstructured":"Halprin, R., Naor, M.: Games for extracting randomness. ACM Crossroads 17(2), 44\u201348 (2010)","journal-title":"ACM Crossroads"},{"key":"9690_CR11","volume-title":"Algorithmic rationality: game theory with costly computation","author":"JY Halpern","year":"2014","unstructured":"Halpern, J.Y., Pass, R.: Algorithmic rationality: game theory with costly computation (2014)"},{"key":"9690_CR12","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (Extended Abstract). In: 30Th annual symposium on foundations of computer science, research triangle park, pp 230\u2013235, North Carolina (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"9690_CR13","volume-title":"Pseudo-random generators for cryptography and for randomized algorithms","author":"R Impagliazzo","year":"1992","unstructured":"Impagliazzo, R.: Pseudo-random generators for cryptography and for randomized algorithms. PhD thesis, University of California, Berkeley (1992)"},{"key":"9690_CR14","doi-asserted-by":"crossref","unstructured":"Kalyanaraman, S., Umans, C.: Algorithms for playing games with limited randomness. In: Algorithms\u2013ESA 2007, pp 323\u2013334. Springer (2007)","DOI":"10.1007\/978-3-540-75520-3_30"},{"issue":"1","key":"9690_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1006\/game.1998.0674","volume":"29","author":"A Neyman","year":"1999","unstructured":"Neyman, A., Okada, D.: Strategic entropy and complexity in repeated games. Games Econ. Behav. 29(1), 191\u2013223 (1999)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"9690_CR16","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/game.1999.0725","volume":"30","author":"A Neyman","year":"2000","unstructured":"Neyman, A., Okada, D.: Repeated games with bounded entropy. Games Econ. Behav. 30(2), 228\u2013247 (2000)","journal-title":"Games Econ. Behav."},{"key":"9690_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Rothblum, G.N.: Learning to impersonate. In: Machine learning, proceedings of the twenty-third international conference (ICML 2006), pp 649\u2013656, Pittsburgh (2006)","DOI":"10.1145\/1143844.1143926"},{"key":"9690_CR18","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT press (1994)"},{"key":"9690_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (Extended Abstract). In: 23rd annual symposium on foundations of computer science, pp 80\u201391, Chicago (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9690-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9690-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9690-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T22:34:37Z","timestamp":1600727677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9690-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,9]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9690"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9690-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,9]]}}}