{"id":"https://openalex.org/W170748079","doi":null,"title":"Strategic planning for imperfect-information games","display_name":"Strategic planning for imperfect-information games","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W170748079","mag":"170748079"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.6778","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.etl.go.jp/~7236/Bridge/Papers/smith-nau-stratplanning.ps.Z","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"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/A5014209826","display_name":"Stephen J. Smith","orcid":"https://orcid.org/0000-0002-0066-1357","observed_orcids":["https://orcid.org/0000-0002-0066-1357"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen J. Smith","raw_affiliation_strings":["University of Maryland, College Park"],"raw_orcid":"https://orcid.org/0000-0002-0066-1357","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084686808","display_name":"Dana S. Nau","orcid":"https://orcid.org/0000-0001-6940-6293","observed_orcids":["https://orcid.org/0000-0001-6940-6293"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana S. Nau","raw_affiliation_strings":["University of Maryland, College Park"],"raw_orcid":"https://orcid.org/0000-0001-6940-6293","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.5726,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88743005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9603999853134155,"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.9603999853134155,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.03889999911189079,"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":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/imperfect-information-games","display_name":"imperfect information games","score":0.9210000038146973},{"id":"https://openalex.org/keywords/strategic-planning","display_name":"strategic planning","score":0.8109999895095825},{"id":"https://openalex.org/keywords/game-tree-search","display_name":"game tree search","score":0.9549999833106995},{"id":"https://openalex.org/keywords/bridges","display_name":"bridges","score":0.5659999847412109},{"id":"https://openalex.org/keywords/task-networks","display_name":"task networks","score":0.8119999766349792},{"id":"https://openalex.org/keywords/uncertainty","display_name":"uncertainty","score":0.6850000023841858},{"id":"https://openalex.org/keywords/branching-factor-reduction","display_name":"branching factor reduction","score":0.8669999837875366},{"id":"https://openalex.org/keywords/game-playing-programs","display_name":"game-playing programs","score":0.8679999709129333}],"concepts":[{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.7873959541320801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6925656199455261},{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.6435909867286682},{"id":"https://openalex.org/C167573328","wikidata":"https://www.wikidata.org/wiki/Q7439054","display_name":"Screening game","level":4,"score":0.6198241710662842},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.6021723747253418},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.562980055809021},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.5301217436790466},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5067015290260315},{"id":"https://openalex.org/C47175762","wikidata":"https://www.wikidata.org/wiki/Q13422573","display_name":"Non-cooperative game","level":3,"score":0.42765113711357117},{"id":"https://openalex.org/C146930158","wikidata":"https://www.wikidata.org/wiki/Q656416","display_name":"Extensive-form game","level":4,"score":0.42489200830459595},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41940340399742126},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3794650733470917},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34804439544677734},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.29449981451034546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16961058974266052},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.6778","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.6778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.etl.go.jp/~7236/Bridge/Papers/smith-nau-stratplanning.ps.Z","raw_type":"text"},{"id":"pmh:oai:drum.lib.umd.edu:1903/5401","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/5401","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Technical Report"},{"id":"mag:170748079","doi":null,"is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/handle/1903/5401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W123935878","https://openalex.org/W125130877","https://openalex.org/W185625752","https://openalex.org/W631070179","https://openalex.org/W1484780672","https://openalex.org/W1613651675","https://openalex.org/W1681012631","https://openalex.org/W1981627423","https://openalex.org/W1985283069","https://openalex.org/W2017799486","https://openalex.org/W2022090818","https://openalex.org/W2064836318","https://openalex.org/W2080884762","https://openalex.org/W2091093248","https://openalex.org/W2114367119","https://openalex.org/W2155551977","https://openalex.org/W2752853835","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W108591472","https://openalex.org/W7099556037","https://openalex.org/W2117324642","https://openalex.org/W7097070704","https://openalex.org/W10452781","https://openalex.org/W1969269538","https://openalex.org/W7100666874","https://openalex.org/W2462896944","https://openalex.org/W7099711915","https://openalex.org/W3130605884"],"abstract_inverted_index":{"Although":[0],"game-tree":[1,47,163],"search":[2,164,200],"works":[3],"well":[4],"in":[5,11,107,168,201,216],"perfect-information":[6],"games,":[7,68],"there":[8],"are":[9],"problems":[10,212],"trying":[12],"to":[13,72,89,103,182,230,245],"use":[14],"it":[15,147],"for":[16,58],"imperfect-":[17],"information":[18,74],"games":[19],"such":[20],"as":[21,180],"bridge.":[22],"The":[23],"lack":[24],"of":[25,66,82,111,120,127,136,142],"knowledge":[26,218],"about":[27,75,177],"the":[28,33,42,76,109,118,125,140,169,172,183,202,228],"opponents'":[29],"possible":[30,121],"moves":[31],"gives":[32],"game":[34,77,105,141,173,198],"tree":[35,43,174,199],"a":[36,64,79,83,96,151,196,247],"very":[37],"large":[38],"branching":[39,154],"factor,":[40],"making":[41],"so":[44],"immense":[45],"that":[46,86,99,146,190,213,224],"searching":[48],"is":[49,87,114],"infeasible.":[50],"In":[51,133],"this":[52,60,101,137],"paper,":[53],"we":[54,144,242],"describe":[55,70],"our":[56,134,206,225],"approach":[57,102,138,207,226],"overcoming":[59],"problem.":[61],"We":[62,94],"develop":[63],"model":[65],"imperfect-information":[67],"and":[69,92,130,240],"how":[71],"represent":[73,90],"using":[78],"modified":[80],"version":[81],"task":[84],"network":[85],"extended":[88],"multi-agency":[91],"uncertainty.":[93],"present":[95],"game-playing":[97],"procedure":[98],"uses":[100],"generate":[104],"trees":[106,149],"which":[108],"set":[110,119,126],"alternative":[112],"choices":[113],"determined":[115],"not":[116],"by":[117,124,161,195],"actions,":[122],"but":[123],"available":[128],"tactical":[129],"strategic":[131],"schemes.":[132],"tests":[135,222],"on":[139],"bridge,":[143],"found":[145],"generated":[148,160],"having":[150],"much":[152,234],"smaller":[153],"factor":[155],"than":[156,236],"would":[157,191],"have":[158,192,243],"been":[159,193],"conventional":[162],"techniques.":[165],"Thus,":[166],"even":[167],"worst":[170,203],"case,":[171],"contained":[175],"only":[176],"1300":[178],"nodes,":[179],"opposed":[181],"approximately":[184],"6.01":[185],"44,":[186],"x":[187],"10":[188],"nodes":[189],"produced":[194],"brute-force":[197],"case.":[204],"Furthermore,":[205],"successfully":[208],"solved":[209],"typical":[210],"bridge":[211],"matched":[214],"situations":[215],"its":[217],"base.":[219],"These":[220],"preliminary":[221],"suggest":[223],"has":[227],"potential":[229],"yield":[231],"bridge-playing":[232],"programs":[233],"better":[235],"existing":[237],"ones":[238],"-":[239],"thus":[241],"begun":[244],"build":[246],"full":[248],"implementation.":[249]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}