{"id":"https://openalex.org/W2765727660","doi":"https://doi.org/10.1007/978-3-319-89366-2_20","title":"The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes","display_name":"The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2765727660","doi":"https://doi.org/10.1007/978-3-319-89366-2_20","mag":"2765727660"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-89366-2_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-89366-2_20","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-319-89366-2_20.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-319-89366-2_20.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104581658","display_name":"St\u00e9phane Le Roux","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"St\u00e9phane Le Roux","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","Department of Mathematics , Technische Universit\u00e4t Darmstadt , Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Department of Mathematics , Technische Universit\u00e4t Darmstadt , Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053423392","display_name":"Guillermo A. P\u00e9rez","orcid":"https://orcid.org/0000-0002-1200-4952"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Guillermo A. P\u00e9rez","raw_affiliation_strings":["Departement d\u2019Informatique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"affiliations":[{"raw_affiliation_string":"Departement d\u2019Informatique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104581658"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01896772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9970999956130981,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/reachability","display_name":"Reachability","score":0.9192601442337036},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7476261854171753},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.6070570945739746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5895084142684937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5592858195304871},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4751408100128174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4738509953022003},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.46741676330566406},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.466635525226593},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.44949600100517273},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41053539514541626},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.40163302421569824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19977763295173645},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08487305045127869}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9192601442337036},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7476261854171753},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.6070570945739746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5895084142684937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5592858195304871},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4751408100128174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4738509953022003},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.46741676330566406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.466635525226593},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.44949600100517273},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41053539514541626},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.40163302421569824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19977763295173645},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08487305045127869}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-89366-2_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-89366-2_20","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-319-89366-2_20.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"mag:2765727660","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1710.07903","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:dipot.ulb.ac.be:2013/270553","is_oa":true,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/270553","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture notes in computer science, 10803 LNCS","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":{"id":"doi:10.1007/978-3-319-89366-2_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-89366-2_20","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-319-89366-2_20.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.800000011920929,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G5679694945","display_name":null,"funder_award_id":"Aspirant","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2765727660.pdf","grobid_xml":"https://content.openalex.org/works/W2765727660.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W249340682","https://openalex.org/W645876618","https://openalex.org/W1498432697","https://openalex.org/W1556387789","https://openalex.org/W1583191255","https://openalex.org/W1792768639","https://openalex.org/W1862398452","https://openalex.org/W1972203711","https://openalex.org/W1979101142","https://openalex.org/W2025063471","https://openalex.org/W2107726111","https://openalex.org/W2135366134","https://openalex.org/W2151715608","https://openalex.org/W2240086230","https://openalex.org/W2255054336","https://openalex.org/W2405532007","https://openalex.org/W2548674525","https://openalex.org/W2569646339","https://openalex.org/W2593267253","https://openalex.org/W2739508666","https://openalex.org/W2963778636","https://openalex.org/W2963975770","https://openalex.org/W4250417675"],"related_works":["https://openalex.org/W2963629611","https://openalex.org/W3081077165","https://openalex.org/W2256709084","https://openalex.org/W1970088948","https://openalex.org/W2917173529","https://openalex.org/W2115044435","https://openalex.org/W2964206744","https://openalex.org/W2181972042","https://openalex.org/W1611993677","https://openalex.org/W1595524083","https://openalex.org/W2150610870","https://openalex.org/W1661159058","https://openalex.org/W2953319076","https://openalex.org/W2225054234","https://openalex.org/W2949070701","https://openalex.org/W227831831","https://openalex.org/W2001654744","https://openalex.org/W2112624678","https://openalex.org/W3109890488","https://openalex.org/W2983251507"],"abstract_inverted_index":{"We":[0,93],"study":[1],"the":[2,26,31,41,48,51,65,70,73,77,96,103,119],"never-worse":[3],"relation":[4,67],"(NWR)":[5],"for":[6],"Markov":[7],"decision":[8,98],"processes":[9],"with":[10],"an":[11],"infinite-horizon":[12],"reachability":[13],"objective.":[14],"A":[15],"state":[16,23],"q":[17],"is":[18,38,105],"never":[19],"worse":[20],"than":[21],"a":[22,110],"p":[24,37],"if":[25],"maximal":[27],"probability":[28],"of":[29,34,47,64],"reaching":[30],"target":[32],"set":[33],"states":[35,59,75,89],"from":[36,44],"at":[39],"most":[40],"same":[42,78],"value":[43],"q,":[45],"regardless":[46],"probabilities":[49],"labelling":[50],"transitions.":[52],"Extremal-probability":[53],"states,":[54],"end":[55],"components,":[56],"and":[57],"essential":[58],"are":[60],"all":[61],"special":[62],"cases":[63],"equivalence":[66,79],"induced":[68],"by":[69],"NWR.":[71,120],"Using":[72],"NWR,":[74],"in":[76],"class":[80],"can":[81,90],"be":[82,91],"collapsed.":[83],"Then,":[84],"actions":[85],"leading":[86],"to":[87,101,117],"sub-optimal":[88],"removed.":[92],"show":[94],"that":[95],"natural":[97],"problem":[99],"associated":[100],"computing":[102],"NWR":[104],"coNP-complete.":[106],"Finally,":[107],"we":[108],"extend":[109],"previously":[111],"known":[112],"incomplete":[113],"polynomial-time":[114],"iterative":[115],"algorithm":[116],"under-approximate":[118]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}