{"id":"https://openalex.org/W4230458283","doi":"https://doi.org/10.1109/lics.2017.8005090","title":"Computing quantiles in Markov chains with multi-dimensional costs","display_name":"Computing quantiles in Markov chains with multi-dimensional costs","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4230458283","doi":"https://doi.org/10.1109/lics.2017.8005090"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067755649","display_name":"Christoph Haase","orcid":"https://orcid.org/0000-0002-5452-936X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christoph Haase","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054782057","display_name":"Stefan Kiefer","orcid":"https://orcid.org/0000-0003-4173-6877"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stefan Kiefer","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]},{"id":"https://openalex.org/I2800742272","display_name":"Folkwang University of the Arts","ror":"https://ror.org/03gf02c22","country_code":"DE","type":"education","lineage":["https://openalex.org/I2800742272"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["Universit\u00e4t Siegen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Siegen, Germany","institution_ids":["https://openalex.org/I206895457","https://openalex.org/I2800742272"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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.9975000023841858,"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.9936000108718872,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/markov-chain","display_name":"Markov chain","score":0.6033305525779724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.564723789691925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5535246133804321},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4873715043067932},{"id":"https://openalex.org/keywords/quantile","display_name":"Quantile","score":0.48287251591682434},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.45250970125198364},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4251301884651184},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.369577020406723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36885517835617065},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3425825238227844}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6033305525779724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.564723789691925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5535246133804321},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4873715043067932},{"id":"https://openalex.org/C118671147","wikidata":"https://www.wikidata.org/wiki/Q578714","display_name":"Quantile","level":2,"score":0.48287251591682434},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.45250970125198364},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4251301884651184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.369577020406723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36885517835617065},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3425825238227844},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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":1,"locations":[{"id":"doi:10.1109/lics.2017.8005090","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W144199319","https://openalex.org/W147131300","https://openalex.org/W1494939852","https://openalex.org/W1495766446","https://openalex.org/W1498432697","https://openalex.org/W1524248088","https://openalex.org/W1552288906","https://openalex.org/W1555770805","https://openalex.org/W1590902061","https://openalex.org/W1600623983","https://openalex.org/W1795375859","https://openalex.org/W1852236200","https://openalex.org/W1862398452","https://openalex.org/W1887562516","https://openalex.org/W1908819570","https://openalex.org/W1989159237","https://openalex.org/W1993180032","https://openalex.org/W2024091095","https://openalex.org/W2040721698","https://openalex.org/W2044782476","https://openalex.org/W2100034226","https://openalex.org/W2137407595","https://openalex.org/W2153575169","https://openalex.org/W2160029445","https://openalex.org/W2166998594","https://openalex.org/W2167091017","https://openalex.org/W2222812367","https://openalex.org/W2258803848","https://openalex.org/W2396234570","https://openalex.org/W2410243683","https://openalex.org/W2465067896","https://openalex.org/W2899702797","https://openalex.org/W2950372505","https://openalex.org/W2963258939","https://openalex.org/W6605905404","https://openalex.org/W6629242308","https://openalex.org/W6635259326","https://openalex.org/W6638153696","https://openalex.org/W6638944184","https://openalex.org/W6692382877","https://openalex.org/W6712385367","https://openalex.org/W6719274018"],"related_works":["https://openalex.org/W1488761988","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2127999608","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"Probabilistic":[0],"systems":[1],"that":[2,96,145,165],"accumulate":[3],"quantities":[4],"such":[5,66,84,120],"as":[6,67,121],"energy":[7],"or":[8,71,89],"cost":[9,14,40,55,70,151],"are":[10,17,22,86],"naturally":[11],"modelled":[12],"by":[13,182],"chains,":[15],"which":[16,57],"Markov":[18],"chains":[19],"whose":[20],"transitions":[21],"labelled":[23],"with":[24,102],"a":[25,42,135,146,158],"vector":[26],"of":[27,36,62,74,131,149,179],"numerical":[28],"costs.":[29,76],"Computing":[30],"information":[31],"on":[32],"the":[33,37,53,63,68,72,100,122,129,150,155,162,167,177],"probability":[34,73],"distribution":[35],"total":[38,64],"accumulated":[39],"is":[41,58,79,107,170],"fundamental":[43],"problem":[44,82,152],"in":[45,134,154,172],"this":[46,49],"model.":[47],"In":[48],"paper,":[50],"we":[51,92,175],"study":[52],"so-called":[54,123],"problem,":[56],"to":[59,98,109,143,161],"compute":[60],"quantiles":[61],"cost,":[65],"median":[69],"large":[75],"While":[77],"it":[78,184],"an":[80,94],"open":[81],"whether":[83],"probabilities":[85,101],"always":[87],"computable":[88],"even":[90],"rational,":[91],"present":[93],"algorithm":[95,106,140,181],"allows":[97],"approximate":[99],"arbitrary":[103],"precision.":[104],"The":[105],"simple":[108],"state":[110],"and":[111,113,169],"implement,":[112],"exploits":[114],"strong":[115],"results":[116],"from":[117],"graph":[118],"theory":[119],"BEST":[124],"theorem":[125],"for":[126],"efficiently":[127],"computing":[128],"number":[130],"Eulerian":[132],"circuits":[133],"directed":[136],"graph.":[137],"Moreover,":[138],"our":[139,180],"enables":[141],"us":[142],"show":[144],"decision":[147],"version":[148],"lies":[153],"counting":[156,159],"hierarchy,":[157],"analogue":[160],"polynomial-time":[163],"hierarchy":[164],"contains":[166],"latter":[168],"included":[171],"PSPACE.":[173],"Finally,":[174],"demonstrate":[176],"applicability":[178],"evaluating":[183],"experimentally.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}