{"id":"https://openalex.org/W1970088948","doi":"https://doi.org/10.1016/0304-3975(95)00158-1","title":"On the complexity of partially observed Markov decision processes","display_name":"On the complexity of partially observed Markov decision processes","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W1970088948","doi":"https://doi.org/10.1016/0304-3975(95)00158-1","mag":"1970088948"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(95)00158-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00158-1","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595001581/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/0304397595001581/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026029143","display_name":"Dima Burago","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dima Burago","raw_affiliation_strings":["LRI, Universit\u00e9 Paris-Sud, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, Universit\u00e9 Paris-Sud, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029937539","display_name":"Michel de Rougemont","orcid":"https://orcid.org/0000-0001-6518-8874"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel de Rougemont","raw_affiliation_strings":["Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, B\u00e2t. 490, F-91405 Orsay, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, B\u00e2t. 490, F-91405 Orsay, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024736709","display_name":"Anatol Slissenko","orcid":null},"institutions":[{"id":"https://openalex.org/I169645620","display_name":"Institut Pascal","ror":"https://ror.org/03vgfxd91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I169645620","https://openalex.org/I198244214","https://openalex.org/I4210095849"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anatol Slissenko","raw_affiliation_strings":["LITP, Institut Blaise Pascal, Paris, France","Universit\u00e9 Paris-12, B\u00e2t.P3, Informatique, 61, Ave. du G\u00e9n\u00e9ral de Gaulle, 94010 Cr\u00e9teil, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITP, Institut Blaise Pascal, Paris, France","institution_ids":["https://openalex.org/I169645620"]},{"raw_affiliation_string":"Universit\u00e9 Paris-12, B\u00e2t.P3, Informatique, 61, Ave. du G\u00e9n\u00e9ral de Gaulle, 94010 Cr\u00e9teil, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024736709"],"corresponding_institution_ids":["https://openalex.org/I169645620"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":{"value":2600,"currency":"USD","value_usd":2600},"fwci":1.1375,"has_fulltext":true,"cited_by_count":35,"citation_normalized_percentile":{"value":0.8010604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"157","issue":"2","first_page":"161","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9925000071525574,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9883999824523926,"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/unobservable","display_name":"Unobservable","score":0.788786768913269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6428917646408081},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6002375483512878},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5908123850822449},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.537950336933136},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5121698379516602},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.5076390504837036},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4627300500869751},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4278866946697235},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.41821929812431335},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.411064475774765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40470296144485474},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3636610507965088},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34938812255859375}],"concepts":[{"id":"https://openalex.org/C2780695315","wikidata":"https://www.wikidata.org/wiki/Q3799040","display_name":"Unobservable","level":2,"score":0.788786768913269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6428917646408081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6002375483512878},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5908123850822449},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.537950336933136},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5121698379516602},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.5076390504837036},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4627300500869751},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4278866946697235},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.41821929812431335},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.411064475774765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40470296144485474},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3636610507965088},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34938812255859375},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(95)00158-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00158-1","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595001581/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.8947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.8947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~mdr/slisstcsfinal0.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/0304-3975(95)00158-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00158-1","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595001581/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322285","display_name":"Japan Nuclear Energy Safety Organization","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1970088948.pdf","grobid_xml":"https://content.openalex.org/works/W1970088948.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1486993561","https://openalex.org/W1506378440","https://openalex.org/W1532832590","https://openalex.org/W1992876208","https://openalex.org/W2002444764","https://openalex.org/W2011039300","https://openalex.org/W2019851160","https://openalex.org/W2032100464","https://openalex.org/W2096630263","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2126572568","https://openalex.org/W2132750992","https://openalex.org/W2134106111","https://openalex.org/W2323009482","https://openalex.org/W2334782222","https://openalex.org/W2400283444","https://openalex.org/W2751862591","https://openalex.org/W6630400633","https://openalex.org/W6631745265","https://openalex.org/W6678919253","https://openalex.org/W6703110798"],"related_works":["https://openalex.org/W2614563012","https://openalex.org/W4293337373","https://openalex.org/W1968533609","https://openalex.org/W2486803649","https://openalex.org/W1984270607","https://openalex.org/W2151842462","https://openalex.org/W2349333549","https://openalex.org/W2116445905","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"In":[0],"the":[1,5,25,67,71,84,99,102,105,109,118,128,147,154,171,178,199],"paper":[2],"we":[3,113,125],"consider":[4],"complexity":[6,79],"of":[7,15,24,66,80,86,91,101,117,120,130,149,156,162,180,195],"constructing":[8,38,131],"optimal":[9,39,139,183],"policies":[10],"(strategies)":[11],"for":[12],"some":[13,167],"type":[14],"partially":[16,163],"observed":[17,164],"Markov":[18,81],"decision":[19,82],"processes.":[20],"This":[21],"particular":[22],"case":[23,85,107,148,161],"classical":[26],"problem":[27,129,179],"deals":[28],"with":[29,52],"finite":[30],"stationary":[31],"processes,":[32],"and":[33,55,95,122],"can":[34],"be":[35],"represented":[36],"as":[37],"strategies":[40],"to":[41,62,75,137,198],"reach":[42],"target":[43],"vertices":[44,54,69],"from":[45,58],"a":[46,50,76,133,150,160],"starting":[47],"vertex":[48],"in":[49,83],"graph":[51],"colored":[53],"probabilistic":[56],"deviations":[57],"an":[59,115,138,182],"edge":[60],"chosen":[61],"follow.":[63],"The":[64,78],"colors":[65,110],"visited":[68],"is":[70,93,141,159,173,185],"only":[72],"information":[73,88],"available":[74],"strategy.":[77],"perfect":[87],"(bijective":[89],"coloring":[90],"vertices)":[92],"known":[94],"briefly":[96],"surveyed":[97],"at":[98],"beginning":[100],"paper.":[103],"For":[104],"unobservable":[106],"(all":[108],"are":[111,191,202],"equal)":[112],"give":[114],"improvement":[116],"result":[119],"Papadimitriou":[121],"Tsitsiklis,":[123],"namely":[124],"show":[126,176],"that":[127,158,177],"even":[132],"very":[134],"weak":[135],"approximation":[136],"strategy":[140,184],"NP-hard.":[142],"Our":[143],"main":[144],"results":[145,197],"concern":[146],"fixed":[151],"bound":[152,169],"on":[153,170],"multiplicity":[155],"coloring,":[157],"processes":[165],"where":[166],"upper":[168],"unobservability":[172],"supposed.":[174],"We":[175],"finding":[181],"still":[186],"NP-hard,":[187],"but":[188],"polytime":[189],"approximations":[190],"possible.":[192],"Some":[193],"relations":[194],"our":[196],"Max-Word":[200],"Problem":[201],"also":[203],"indicated.":[204]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-03T07:22:36.454288","created_date":"2025-10-10T00:00:00"}