{"id":"https://openalex.org/W193176855","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-054","title":"Accelerating best response calculation in large extensive games","display_name":"Accelerating best response calculation in large extensive games","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W193176855","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-054","mag":"193176855"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.472","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/%7Egames/poker/publications/ijcai2011_accelerated_best_response.pdf","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090154151","display_name":"Michael Johanson","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael Johanson","raw_affiliation_strings":["Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045201269","display_name":"Kevin Waugh","orcid":"https://orcid.org/0009-0009-0267-3878"},"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":"Kevin Waugh","raw_affiliation_strings":["Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":"https://orcid.org/0009-0009-0267-3878","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081163135","display_name":"Michael Bowling","orcid":"https://orcid.org/0000-0003-2960-8418"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael Bowling","raw_affiliation_strings":["Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2960-8418","affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta.Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112356991","display_name":"Martin Zinkevich","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Zinkevich","raw_affiliation_strings":["Yahoo Research, Santa Clara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo Research, Santa Clara, CA","institution_ids":["https://openalex.org/I4210134091"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.9482,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.97829816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9998999834060669,"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.9998999834060669,"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/T11674","display_name":"Sports Analytics and Performance","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11197","display_name":"Digital Games and Media","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.9641919136047363},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8418158888816833},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6459934115409851},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6290603280067444},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5915912389755249},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.582208514213562},{"id":"https://openalex.org/keywords/perfect-information","display_name":"Perfect information","score":0.5515298247337341},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.539448618888855},{"id":"https://openalex.org/keywords/imperfect","display_name":"Imperfect","score":0.5065926313400269},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46934759616851807},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.33291929960250854},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.32571470737457275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2697044909000397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07676845788955688}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9641919136047363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8418158888816833},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6459934115409851},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6290603280067444},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5915912389755249},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.582208514213562},{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.5515298247337341},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.539448618888855},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.5065926313400269},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46934759616851807},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.33291929960250854},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.32571470737457275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2697044909000397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07676845788955688},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.472","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/%7Egames/poker/publications/ijcai2011_accelerated_best_response.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.231.387","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/%7Ebowling/papers/11ijcai-rgbr.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.374.4722","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.4722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://martin.zinkevich.org/publications/ijcai2011_rgbr.pdf","raw_type":"text"},{"id":"mag:193176855","is_oa":false,"landing_page_url":"http://martin.zinkevich.org/publications/ijcai2011_rgbr.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1482508514","https://openalex.org/W1528107507","https://openalex.org/W1980392196","https://openalex.org/W2103315867","https://openalex.org/W2109100253","https://openalex.org/W2123018439"],"related_works":["https://openalex.org/W2103315867","https://openalex.org/W2106975967","https://openalex.org/W1980392196","https://openalex.org/W2773381986","https://openalex.org/W2006791053","https://openalex.org/W2574978968","https://openalex.org/W2126776273","https://openalex.org/W2123018439","https://openalex.org/W190498140","https://openalex.org/W1664963465","https://openalex.org/W2950376443","https://openalex.org/W2098111478","https://openalex.org/W1482508514","https://openalex.org/W2739393805","https://openalex.org/W2168356773","https://openalex.org/W2109100253","https://openalex.org/W2121513215","https://openalex.org/W2086312499","https://openalex.org/W1528107507","https://openalex.org/W2102509082"],"abstract_inverted_index":{"One":[0],"fundamental":[1],"evaluation":[2],"criteria":[3],"of":[4,92,95,122,148],"an":[5],"AI":[6],"technique":[7,60],"is":[8,46,77,133],"its":[9],"performance":[10,91,126],"in":[11,17,97,127],"the":[12,89,120],"worst-case.":[13],"For":[14,37],"static":[15],"strategies":[16,96],"extensive":[18],"games,":[19,40],"this":[20,30,54,85,105],"can":[21,66],"be":[22,145],"computed":[23],"using":[24],"a":[25,32,58,69,93,134],"best":[26,62],"response":[27,63],"computation.":[28],"Conventionally,":[29],"requires":[31],"full":[33,70],"game":[34,71],"tree":[35,72],"traversal.":[36,73],"very":[38],"large":[39,128],"such":[41],"as":[42,115],"poker,":[43],"that":[44,65,136],"traversal":[45],"infeasible":[47],"to":[48,87,104],"perform":[49],"on":[50,124],"modern":[51],"hardware.":[52],"In":[53],"paper,":[55],"we":[56],"detail":[57],"general":[59],"for":[61,80],"computations":[64],"often":[67],"avoid":[68],"Additionally,":[74],"our":[75],"method":[76],"specifically":[78],"well-suited":[79],"parallel":[81],"environments.":[82],"We":[83,110],"apply":[84],"approach":[86],"computing":[88],"worst-case":[90,125],"number":[94],"heads-up":[98],"limit":[99],"Texas":[100],"hold\u2019em,":[101],"which,":[102],"prior":[103],"work,":[106],"was":[107],"not":[108,143],"possible.":[109],"explore":[111],"these":[112],"results":[113],"thoroughly":[114],"they":[116],"provide":[117],"insight":[118],"into":[119],"effects":[121],"abstraction":[123],"imperfect":[129],"information":[130],"games.":[131],"This":[132],"topic":[135],"has":[137],"received":[138],"much":[139],"attention,":[140],"but":[141],"could":[142],"previously":[144],"examined":[146],"outside":[147],"toy":[149],"domains.":[150],"1":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}