{"id":"https://openalex.org/W1511535730","doi":"https://doi.org/10.1109/cdc.2002.1184710","title":"Receding horizon approach to Markov games for infinite horizon discounted cost","display_name":"Receding horizon approach to Markov games for infinite horizon discounted cost","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1511535730","doi":"https://doi.org/10.1109/cdc.2002.1184710","mag":"1511535730"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2002.1184710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5041693183","display_name":"Hyeong Soo Chang","orcid":"https://orcid.org/0000-0003-3298-0018"},"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":true,"raw_author_name":"Hyeong Soo Chang","raw_affiliation_strings":["Dept. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013807415","display_name":"Steven I. Marcus","orcid":"https://orcid.org/0000-0002-4926-9567"},"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":"S.I. Marcus","raw_affiliation_strings":["Dept. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. & Inst. for Syst. Res., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041693183"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.03646423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1380","last_page":"1385 vol.2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.8260526657104492},{"id":"https://openalex.org/keywords/horizon","display_name":"Horizon","score":0.7131611108779907},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.697496235370636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6588373184204102},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6329464316368103},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4977472126483917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47053062915802},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4628009498119354},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.451491117477417},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.44113218784332275},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.41171547770500183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3820306658744812},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3563351035118103}],"concepts":[{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.8260526657104492},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.7131611108779907},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.697496235370636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6588373184204102},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6329464316368103},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4977472126483917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47053062915802},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4628009498119354},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.451491117477417},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.44113218784332275},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.41171547770500183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3820306658744812},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3563351035118103},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2002.1184710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W51114640","https://openalex.org/W74737318","https://openalex.org/W212376186","https://openalex.org/W1489542082","https://openalex.org/W1496590343","https://openalex.org/W1511309222","https://openalex.org/W1522780505","https://openalex.org/W1532584713","https://openalex.org/W1605188341","https://openalex.org/W1648551651","https://openalex.org/W1964265465","https://openalex.org/W2004959510","https://openalex.org/W2009594301","https://openalex.org/W2016211524","https://openalex.org/W2018528465","https://openalex.org/W2019851160","https://openalex.org/W2069356752","https://openalex.org/W2070196343","https://openalex.org/W2074587403","https://openalex.org/W2078556239","https://openalex.org/W2092752818","https://openalex.org/W2098432798","https://openalex.org/W2113439731","https://openalex.org/W2118949809","https://openalex.org/W2128648822","https://openalex.org/W2129512399","https://openalex.org/W2152545378","https://openalex.org/W2567137345","https://openalex.org/W2575731723","https://openalex.org/W3016548437","https://openalex.org/W4233299515","https://openalex.org/W4302033101","https://openalex.org/W4307347247","https://openalex.org/W6603014306","https://openalex.org/W6629411330","https://openalex.org/W6630766731","https://openalex.org/W6631751280"],"related_works":["https://openalex.org/W2152670157","https://openalex.org/W4308702637","https://openalex.org/W2386410636","https://openalex.org/W176737593","https://openalex.org/W2808418668","https://openalex.org/W2903299703","https://openalex.org/W2906267174","https://openalex.org/W2016648086","https://openalex.org/W2156021013","https://openalex.org/W2083611438"],"abstract_inverted_index":{"We":[0,22,90,101,232],"consider":[1],"a":[2,148,170,219,229],"receding":[3,40,52,79,98,125,185,239],"horizon":[4,18,41,54,80,99,126,186,196,240],"approach":[5,127],"as":[6],"an":[7,16],"approximate":[8,49,97,124],"solution":[9],"to":[10,141,150],"two-person":[11],"zero-sum":[12],"Markov":[13,116],"games":[14],"with":[15,194],"infinite":[17],"discounted":[19],"cost":[20],"criterion.":[21],"first":[23],"present":[24],"error":[25,71],"bounds":[26,72],"from":[27],"the":[28,33,58,74,77,83,86,96,115,120,123,133,137,152,157,162,165,181,184,190,195,199,206,211,215,238],"optimal":[29,60,225],"equilibrium":[30],"value":[31,182],"of":[32,51,62,95,122,154,156,183,237],"game":[34,117],"when":[35,73],"both":[36],"players":[37],"take":[38],"\"correlated\"":[39],"policies":[42,146,159],"that":[43,164,189],"are":[44],"based":[45,221],"on":[46,222],"exact":[47],"or":[48],"solutions":[50],"finite":[53,230],"sub-games.":[55],"Motivated":[56],"by":[57,65,108,198,208],"worst-case":[59,172],"control":[61,81],"queueing":[63],"systems":[64],"Altman":[66],"(1995),":[67],"we":[68,179],"then":[69],"analyze":[70,129],"minimizer":[75,200],"plays":[76,85],"(approximate)":[78],"and":[82,105,128],"maximizer":[84],"worst":[87],"case":[88],"policy.":[89,173],"give":[91,180],"two":[92],"heuristic":[93,145,158,203],"examples":[94],"control.":[100],"extend":[102],"\"parallel":[103],"rollout\"":[104],"\"hindsight":[106],"optimization\"":[107],"Chang":[109],"et":[110],"al.":[111],"(2001,":[112],"2000)":[113],"into":[114],"setting":[118],"within":[119],"framework":[121],"their":[130],"performances.":[131],"From":[132,210],"parallel":[134,191],"rollout":[135,192],"approach,":[136,214],"minimizing":[138,216],"player":[139,167,217],"seeks":[140],"combine":[142],"dynamically":[143],"multiple":[144],"in":[147,205],"set":[149,207],"improve":[151],"performances":[153],"all":[155],"simultaneously":[160],"under":[161],"guess":[163],"maximizing":[166],"has":[168],"chosen":[169],"fixed":[171],"Given":[174],"/spl":[175],"epsiv/":[176],">":[177],"0,":[178],"which":[187],"guarantees":[188],"policy":[193,204],"played":[197],"\"dominates\"":[201],"any":[202],"e.":[209],"hindsight":[212,226],"optimization":[213],"makes":[218],"decision":[220],"his":[223],"expected":[224],"performance":[227],"over":[228],"horizon.":[231],"finally":[233],"discuss":[234],"practical":[235],"implementations":[236],"approaches":[241],"via":[242],"simulation.":[243]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}