{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:58:07Z","timestamp":1743076687005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_10","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"139-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Existence of Nash Equilibrium in Games with Resource-Bounded Players"],"prefix":"10.1007","author":[{"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Reichman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Tauman-Kalai, A., Kalai, E.: An approach to bounded rationality. In: Proceedings of the 19th Neural Information Processing Systems Conference, pp. 145\u2013152 (2007)","DOI":"10.7551\/mitpress\/7503.003.0023"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37, 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of two-player Nash equilibrium. J. ACM 53(3) (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"10_CR4","unstructured":"Courtois, N.T., Bahack, L.: On subversive miner strategies and block with holding attack in bitcoin digital currency (2014). arXiv preprint: http:\/\/arxiv.org\/abs\/1402.1718"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112\u2013130. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_7"},{"key":"10_CR7","unstructured":"Feigenbaum, J., Koller, D., Shor, P.W.: A game-theoretic classification of interactive complexity classes. In: Proceedings of the Structure in Complexity Theory Conference, pp. 227\u2013237 (1995)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00037-008-0252-2","volume":"17","author":"L Fortnow","year":"2008","unstructured":"Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the complexity of succinct zero-sum games. Comput. Complex. 17(3), 353\u2013376 (2008)","journal-title":"Comput. Complex."},{"key":"10_CR9","unstructured":"Fortnow, L., Santhanam, R.: Bounding rationality by discounting time. In: Proceedings of Innovations in Computer Science Conference, pp. 143\u2013155 (2010)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jet.2014.04.007","volume":"156","author":"JY Halpern","year":"2015","unstructured":"Halpern, J.Y., Pass, R.: Algorithmic rationality: game theory with costly computation. J. Econ. Theory 156, 246\u2013268 (2015). https:\/\/doi.org\/10.1016\/j.jet.2014.04.007","journal-title":"J. Econ. Theory"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R., Reichman, D.: On the nonexistence of equilibrium in computational games (2019)","DOI":"10.1145\/3340232"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R., Seeman, L.: Computational extensive-form games. In: Proceedings of 17th ACM Conference on Electronic Commerce (EC 2016), pp. 681\u2013698 (2016)","DOI":"10.1145\/2940716.2940733"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11681878_23","volume-title":"Theory of Cryptography","author":"T Holenstein","year":"2006","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: a simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443\u2013461. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_23"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-24698-5_45","volume-title":"LATIN 2004: Theoretical Informatics","author":"RJ Lipton","year":"2004","unstructured":"Lipton, R.J., Markakis, E.: Nash equilibria via polynomial equations. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 413\u2013422. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_45"},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794216","volume-title":"Game Theory","author":"M Maschler","year":"2013","unstructured":"Maschler, M., Solan, E., Zamir, S.: Game Theory. Cambridge University Press, Cambridge (2013)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/B978-0-934613-04-0.50022-3","volume-title":"Theoretical Aspects of Reasoning About Knowledge","author":"Nimrod Megiddo","year":"1986","unstructured":"Megiddo, N., Wigderson, A.: On play by means of computing machines. In: Theoretical Aspects of Reasoning About Knowledge: Proceedings of 1986 Conference, pp. 259\u2013274 (1986)"},{"key":"10_CR17","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54, 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0165-1765(85)90026-6","volume":"19","author":"A Neyman","year":"1985","unstructured":"Neyman, A.: Bounded complexity justifies cooperation in finitely repeated prisoner\u2019s dilemma. Econ. Lett. 19, 227\u2013229 (1985)","journal-title":"Econ. Lett."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/0899-8256(91)90033-B","volume":"3","author":"A Neyman","year":"1991","unstructured":"Neyman, A.: The positive value of information. Games Econ. Behav. 3, 350\u2013355 (1991)","journal-title":"Games Econ. Behav."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.23.3.513","volume":"23","author":"A Neyman","year":"1998","unstructured":"Neyman, A.: Finitely repeated games with finite automata. Math. Oper. Res. 23, 513\u2013552 (1998)","journal-title":"Math. Oper. Res."},{"key":"10_CR22","unstructured":"Oliehook, F., Savani, R., Gallego, J., van der Poel, E., Gross, R.: Beyond local Nash equilibria for adversarial networks (2018). http:\/\/arxiv.org\/abs\/1806.07268"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On complexity as bounded rationality. In: Proceedings of 26th ACM Symposium on Theory of Computing, pp. 726\u2013733 (1994)","DOI":"10.1145\/195058.195445"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0022-0531(86)90021-9","volume":"39","author":"A Rubinstein","year":"1986","unstructured":"Rubinstein, A.: Finite automata play the repeated prisoner\u2019s dilemma. J. Econ. Theory 39, 83\u201396 (1986)","journal-title":"J. Econ. Theory"},{"key":"10_CR25","first-page":"270","volume":"4","author":"G Schoenebeck","year":"2006","unstructured":"Schoenebeck, G., Vadhan, S.: The computational complexity of nash equilibria in concisely represented games. Theory Comput. 4, 270\u2013279 (2006)","journal-title":"Theory Comput."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1884852","volume":"49","author":"HA Simon","year":"1955","unstructured":"Simon, H.A.: A behavioral model of rational choice. Quart. J. Econ. 49, 99\u2013118 (1955). https:\/\/doi.org\/10.2307\/1884852","journal-title":"Quart. J. Econ."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: Proceedings of the 37th ACM Annual Symposium on Theory of Computing, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:33:29Z","timestamp":1709811209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}