{"id":"https://openalex.org/W4226246080","doi":"https://doi.org/10.1145/3505585","title":"Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria","display_name":"Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria","publication_year":2022,"publication_date":"2022-03-31","ids":{"openalex":"https://openalex.org/W4226246080","doi":"https://doi.org/10.1145/3505585"},"language":"en","primary_location":{"id":"doi:10.1145/3505585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3505585","pdf_url":null,"source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/ws/files/357082094/Discounted_Repeated_Games_having_Computable_Strategies.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057010077","display_name":"Jakub Dargaj","orcid":"https://orcid.org/0000-0003-3658-3642"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Jakub Dargaj","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024664299","display_name":"Jakob Grue Simonsen","orcid":"https://orcid.org/0000-0002-3488-9392"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jakob Grue Simonsen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057010077"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.1504,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47216841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":"1","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgame-perfect-equilibrium","display_name":"Subgame perfect equilibrium","score":0.8561052083969116},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.6503833532333374},{"id":"https://openalex.org/keywords/computable-general-equilibrium","display_name":"Computable general equilibrium","score":0.5969144105911255},{"id":"https://openalex.org/keywords/subgame","display_name":"Subgame","score":0.4696319103240967},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.4680701494216919},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3660905361175537},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.35848748683929443},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.1963755190372467},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.161392480134964},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"Equilibrium selection","score":0.06553176045417786}],"concepts":[{"id":"https://openalex.org/C175983524","wikidata":"https://www.wikidata.org/wiki/Q1615834","display_name":"Subgame perfect equilibrium","level":3,"score":0.8561052083969116},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.6503833532333374},{"id":"https://openalex.org/C20522121","wikidata":"https://www.wikidata.org/wiki/Q3589458","display_name":"Computable general equilibrium","level":2,"score":0.5969144105911255},{"id":"https://openalex.org/C13576547","wikidata":"https://www.wikidata.org/wiki/Q3965283","display_name":"Subgame","level":5,"score":0.4696319103240967},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.4680701494216919},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3660905361175537},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.35848748683929443},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.1963755190372467},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.161392480134964},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.06553176045417786}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3505585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3505585","pdf_url":null,"source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1aea9f43-a654-4513-aacb-d786e9fc884b","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/1aea9f43-a654-4513-aacb-d786e9fc884b","pdf_url":"https://curis.ku.dk/ws/files/357082094/Discounted_Repeated_Games_having_Computable_Strategies.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dargaj , J & Simonsen , J G 2022 , ' Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria ' , ACM Transactions on Economics and Computation , vol. 10 , no. 1 , 3 , pp. 1-39 . https://doi.org/10.1145/3505585","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1aea9f43-a654-4513-aacb-d786e9fc884b","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/1aea9f43-a654-4513-aacb-d786e9fc884b","pdf_url":"https://curis.ku.dk/ws/files/357082094/Discounted_Repeated_Games_having_Computable_Strategies.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dargaj , J & Simonsen , J G 2022 , ' Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria ' , ACM Transactions on Economics and Computation , vol. 10 , no. 1 , 3 , pp. 1-39 . https://doi.org/10.1145/3505585","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226246080.pdf","grobid_xml":"https://content.openalex.org/works/W4226246080.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1509579779","https://openalex.org/W1979592899","https://openalex.org/W1984186837","https://openalex.org/W1989293560","https://openalex.org/W1989538212","https://openalex.org/W1995892667","https://openalex.org/W2002149472","https://openalex.org/W2019987083","https://openalex.org/W2031657010","https://openalex.org/W2051280392","https://openalex.org/W2074232820","https://openalex.org/W2077400689","https://openalex.org/W2087974695","https://openalex.org/W2106415019","https://openalex.org/W2131724520","https://openalex.org/W2149365931","https://openalex.org/W2212293086","https://openalex.org/W2249044329","https://openalex.org/W2620577708","https://openalex.org/W2768978272","https://openalex.org/W2868998058","https://openalex.org/W2905135108","https://openalex.org/W2943163431","https://openalex.org/W3041099907","https://openalex.org/W4234277722","https://openalex.org/W4251841679","https://openalex.org/W4255104891","https://openalex.org/W4302571648"],"related_works":["https://openalex.org/W3125676384","https://openalex.org/W169328966","https://openalex.org/W2040293411","https://openalex.org/W1899083786","https://openalex.org/W3122101132","https://openalex.org/W3502586","https://openalex.org/W3124141747","https://openalex.org/W4226246080","https://openalex.org/W1556002740","https://openalex.org/W3150885531"],"abstract_inverted_index":{"A":[0],"classic":[1],"result":[2,37],"in":[3,159,162],"computational":[4],"game":[5,104,137],"theory":[6],"states":[7],"that":[8,21,155],"there":[9],"are":[10],"infinitely":[11],"repeated":[12,103,136],"games":[13,32],"where":[14],"one":[15],"player":[16,86],"has":[17,22],"a":[18,23,43,78,83,101,111,131],"computable":[19,28,67,71,112,116],"strategy":[20,68,113],"best":[24,29,72,117],"response,":[25],"but":[26],"no":[27,54,70,115],"response.":[30],"For":[31],"with":[33,114],"discounted":[34,139],"payoff,":[35],"the":[36,66,90,94,135,145,149,163,166],"is":[38,59,157],"known":[39],"to":[40,108],"hold":[41],"for":[42,100,119],"specific":[44],"class":[45],"of":[46,49,63,77,130,134,148,165,169],"games\u2014essentially":[47],"generalizations":[48],"Prisoner\u2019s":[50],"Dilemma\u2014but":[51],"until":[52],"now,":[53],"necessary":[55,96],"and":[56,97],"sufficient":[57,98],"condition":[58],"known.":[60],"To":[61],"be":[62,75],"any":[64],"value,":[65],"having":[69],"response":[73,118],"must":[74],"part":[76],"subgame-perfect":[79],"equilibrium,":[80],"as":[81],"otherwise":[82],"rational,":[84],"self-interested":[85],"would":[87],"not":[88],"play":[89],"strategy.":[91],"We":[92,153],"give":[93],"first":[95],"conditions":[99,127,143],"two-player":[102],"\\(":[105,170],"G":[106,171],"\\)":[107,172],"have":[109],"such":[110],"all":[120],"discount":[121],"factors":[122],"above":[123],"some":[124],"threshold.":[125],"The":[126],"involve":[128],"existence":[129],"Nash":[132],"equilibrium":[133],"whose":[138],"payoffs":[140,147],"satisfy":[141],"certain":[142],"involving":[144],"min\u2013max":[146],"underlying":[150],"stage":[151],"game.":[152],"show":[154],"it":[156,174],"decidable":[158],"polynomial":[160],"time":[161],"size":[164],"payoff":[167],"matrix":[168],"whether":[173],"satisfies":[175],"these":[176],"conditions.":[177]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}