{"id":"https://openalex.org/W2505491831","doi":"https://doi.org/10.1145/2940716.2940736","title":"Imperfect-Recall Abstractions with Bounds in Games","display_name":"Imperfect-Recall Abstractions with Bounds in Games","publication_year":2016,"publication_date":"2016-07-21","ids":{"openalex":"https://openalex.org/W2505491831","doi":"https://doi.org/10.1145/2940716.2940736","mag":"2505491831"},"language":"en","primary_location":{"id":"doi:10.1145/2940716.2940736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2940716.2940736?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2940716.2940736?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christian Kroer","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christian Kroer","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tuomas Sandholm","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tuomas Sandholm","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.3252,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87255985,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"459","last_page":"476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/class","display_name":"Class (philosophy)","score":0.7226999998092651},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7032999992370605},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5800999999046326},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.5311999917030334},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5206999778747559},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46140000224113464},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.4077000021934509}],"concepts":[{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.7226999998092651},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7032999992370605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438999772071838},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5800999999046326},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5206999778747559},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46140000224113464},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.4077000021934509},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.40310001373291016},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.39890000224113464},{"id":"https://openalex.org/C107257861","wikidata":"https://www.wikidata.org/wiki/Q656316","display_name":"Coordination game","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3725000023841858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31610000133514404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30090001225471497},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2727999985218048},{"id":"https://openalex.org/C201364048","wikidata":"https://www.wikidata.org/wiki/Q2897085","display_name":"Sequential equilibrium","level":5,"score":0.26010000705718994},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2590999901294708},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2940716.2940736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2940716.2940736?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1409.3302","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.3302","pdf_url":"https://arxiv.org/pdf/1409.3302","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2940716.2940736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2940716.2940736?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2614476939","display_name":null,"funder_award_id":"1320620","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2855563079","display_name":null,"funder_award_id":"1546752","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3208095955","display_name":"RI: Mediuim: Abstraction, Equilibrium Finding, Safe Opponent Exploitation, and Robust Strategies for Imperfect-Information Games","funder_award_id":"0964579","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3366966419","display_name":null,"funder_award_id":"W911NF-16-1","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G5810372251","display_name":null,"funder_award_id":"W911NF-16-1-0061","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G657448715","display_name":null,"funder_award_id":"W911NF-16-1-","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8449190896","display_name":"ICES: Small: New and Better Markets via Automated Market Making","funder_award_id":"1101668","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8998121839","display_name":null,"funder_award_id":"911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2505491831.pdf","grobid_xml":"https://content.openalex.org/works/W2505491831.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1439783155","https://openalex.org/W1503151842","https://openalex.org/W1973264045","https://openalex.org/W2006791053","https://openalex.org/W2008393562","https://openalex.org/W2020820252","https://openalex.org/W2023373582","https://openalex.org/W2066327004","https://openalex.org/W2086312499","https://openalex.org/W2086386133","https://openalex.org/W2091358801","https://openalex.org/W2098111478","https://openalex.org/W2103315867","https://openalex.org/W2104402102","https://openalex.org/W2106233414","https://openalex.org/W2112452549","https://openalex.org/W2121180068","https://openalex.org/W2121513215","https://openalex.org/W2123018439","https://openalex.org/W2131967794","https://openalex.org/W2133311553","https://openalex.org/W2138432417","https://openalex.org/W2189215284","https://openalex.org/W2202744812","https://openalex.org/W2293220853","https://openalex.org/W2493063923","https://openalex.org/W2739393805","https://openalex.org/W4300920027"],"related_works":[],"abstract_inverted_index":{"Imperfect-recall":[0],"abstraction":[1],"has":[2],"emerged":[3],"as":[4],"the":[5,34,55,69,103],"leading":[6],"paradigm":[7],"for":[8,41,62,77],"practical":[9],"large-scale":[10],"equilibrium":[11],"computation":[12],"in":[13,49,54,90,102],"imperfect-information":[14],"games.":[15],"However,":[16],"imperfect-recall":[17,50,75],"abstractions":[18,76],"are":[19,30,61],"poorly":[20],"understood,":[21],"and":[22,44],"only":[23,70],"weak":[24],"algorithm-specific":[25],"guarantees":[26,40],"on":[27],"solution":[28,38,104],"quality":[29,39,105],"known.":[31],"We":[32],"develop":[33],"first":[35],"general,":[36],"algorithm-agnostic,":[37],"Nash":[42],"equilibria":[43,47],"approximate":[45],"self-trembling":[46],"computed":[48],"abstractions,":[51],"when":[52],"implemented":[53],"original":[56],"(perfect-recall)":[57],"game.":[58],"Our":[59],"results":[60,81],"a":[63],"class":[64,73],"of":[65,74,94],"games":[66],"that":[67],"generalizes":[68],"previously":[71],"known":[72],"which":[78,95],"any":[79],"such":[80],"have":[82],"been":[83],"obtained.":[84],"Further,":[85],"our":[86],"analysis":[87],"is":[88],"tighter":[89],"two":[91],"ways,":[92],"each":[93],"can":[96],"lead":[97],"to":[98],"an":[99],"exponential":[100],"reduction":[101],"error":[106],"bound.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-08-23T00:00:00"}