{"id":"https://openalex.org/W2094153443","doi":"https://doi.org/10.1109/tac.2014.2314211","title":"Efficient Algorithms for Budget-Constrained Markov Decision Processes","display_name":"Efficient Algorithms for Budget-Constrained Markov Decision Processes","publication_year":2014,"publication_date":"2014-03-28","ids":{"openalex":"https://openalex.org/W2094153443","doi":"https://doi.org/10.1109/tac.2014.2314211","mag":"2094153443"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2014.2314211","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2314211","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-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/A5053978837","display_name":"Constantine Caramanis","orcid":"https://orcid.org/0000-0001-9939-8378"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Constantine Caramanis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA","Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Electr. &, Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112269254","display_name":"Nedialko B. Dimitrov","orcid":null},"institutions":[{"id":"https://openalex.org/I35364215","display_name":"Naval Postgraduate School","ror":"https://ror.org/033yfkj90","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I3130687028","https://openalex.org/I35364215"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nedialko B. Dimitrov","raw_affiliation_strings":["Operations Research Department, Naval Postgraduate School, Monterey, CA, USA","Oper. Res. Dept., Naval Postgrad. Sch., Monterey, CA, USA"],"affiliations":[{"raw_affiliation_string":"Operations Research Department, Naval Postgraduate School, Monterey, CA, USA","institution_ids":["https://openalex.org/I35364215"]},{"raw_affiliation_string":"Oper. Res. Dept., Naval Postgrad. Sch., Monterey, CA, USA","institution_ids":["https://openalex.org/I35364215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015186395","display_name":"David P. Morton","orcid":"https://orcid.org/0000-0001-6001-9078"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Morton","raw_affiliation_strings":["Graduate Program in Operations Research, The University of Texas at Austin, Austin, TX, USA","Grad. Program in Oper. Res., Univ. of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Graduate Program in Operations Research, The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Grad. Program in Oper. Res., Univ. of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053978837"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":1.0752,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.81675134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"59","issue":"10","first_page":"2813","last_page":"2817"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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":0.9980000257492065,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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/T11182","display_name":"Auction Theory and Applications","score":0.9965999722480774,"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/markov-decision-process","display_name":"Markov decision process","score":0.6712294220924377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.640067458152771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.454969197511673},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45223140716552734},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.44940680265426636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4301447868347168},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20999523997306824},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17037856578826904},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07038244605064392}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6712294220924377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.640067458152771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.454969197511673},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45223140716552734},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.44940680265426636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4301447868347168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20999523997306824},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17037856578826904},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07038244605064392}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tac.2014.2314211","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2314211","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:calhoun.nps.edu:10945/48019","is_oa":false,"landing_page_url":"http://hdl.handle.net/10945/48019","pdf_url":null,"source":{"id":"https://openalex.org/S4306400952","display_name":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35364215","host_organization_name":"Naval Postgraduate School","host_organization_lineage":["https://openalex.org/I35364215"],"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":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1649611664","display_name":null,"funder_award_id":"CMMI-0653916","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5883381455","display_name":null,"funder_award_id":"CMMI-0800676","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G670075631","display_name":null,"funder_award_id":"HDTRA1-08-1-0029","funder_id":"https://openalex.org/F4320332186","funder_display_name":"Defense Threat Reduction Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332186","display_name":"Defense Threat Reduction Agency","ror":"https://ror.org/04tz64554"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1509805685","https://openalex.org/W1518931405","https://openalex.org/W1762430620","https://openalex.org/W1980102442","https://openalex.org/W1983743030","https://openalex.org/W1993161326","https://openalex.org/W1993986344","https://openalex.org/W1995032206","https://openalex.org/W2003889804","https://openalex.org/W2026477372","https://openalex.org/W2028145673","https://openalex.org/W2029958121","https://openalex.org/W2054443446","https://openalex.org/W2054716087","https://openalex.org/W2063753743","https://openalex.org/W2069873069","https://openalex.org/W2076680677","https://openalex.org/W2081606755","https://openalex.org/W2082815106","https://openalex.org/W2085680165","https://openalex.org/W2089631446","https://openalex.org/W2090973833","https://openalex.org/W2103406407","https://openalex.org/W2104103056","https://openalex.org/W2105560970","https://openalex.org/W2106887613","https://openalex.org/W2150865801","https://openalex.org/W2154776403","https://openalex.org/W2168024904","https://openalex.org/W2949773717","https://openalex.org/W4240186237","https://openalex.org/W4250589301","https://openalex.org/W4293860921","https://openalex.org/W6684620542"],"related_works":["https://openalex.org/W2913022628","https://openalex.org/W2161367706","https://openalex.org/W1990452411","https://openalex.org/W2117282672","https://openalex.org/W1995828591","https://openalex.org/W2026691440","https://openalex.org/W2104198943","https://openalex.org/W2029936267","https://openalex.org/W2985981384","https://openalex.org/W3198596521"],"abstract_inverted_index":{"Discounted,":[0],"discrete-time,":[1],"discrete":[2,4],"state-space,":[3],"action-space":[5],"Markov":[6],"decision":[7],"processes":[8],"(MDPs)":[9],"form":[10],"a":[11,22,180,222,243],"classical":[12],"topic":[13],"in":[14,28,65,74,172,195],"control,":[15],"game":[16],"theory,":[17],"and":[18,20,129,152],"learning,":[19],"as":[21,49,138,140],"result":[23],"are":[24,46,51,137],"widely":[25],"applied,":[26],"increasingly,":[27],"very":[29],"large-scale":[30,39],"applications.":[31],"Many":[32],"algorithms":[33,132,257],"have":[34],"been":[35],"developed":[36],"to":[37,251,260],"solve":[38],"MDPs.":[40],"Algorithms":[41],"based":[42],"on":[43],"value":[44,141,148,234],"iteration":[45,149,235],"particularly":[47],"popular,":[48],"they":[50],"more":[52,82],"efficient":[53,83,139],"than":[54,85],"the":[55,66,71,75,100,110,114,144,153,156,188,218,248],"generic":[56],"linear":[57,86,96],"programming":[58,87,97],"approach,":[59],"by":[60,150,158,221],"an":[61,161],"order":[62],"of":[63,68,70,77,95,102,112,147,155,183,217,225],"magnitude":[64,154],"number":[67],"states":[69],"MDP.":[72],"Yet":[73],"case":[76],"budget":[78,166,189],"constrained":[79,103,261],"MDPs,":[80],"no":[81],"algorithm":[84,170,193],"is":[88,116,127],"known.":[89],"The":[90],"theoretically":[91],"slower":[92],"running":[93,145],"times":[94],"may":[98,211],"limit":[99],"scalability":[101],"MDPs":[104,135,263],"piratically;":[105],"while,":[106],"theoretically,":[107],"it":[108,126],"invites":[109],"question":[111],"whether":[113],"increase":[115],"somehow":[117],"intrinsic.":[118],"In":[119,229],"this":[120],"technical":[121],"note":[122],"we":[123],"show":[124],"that":[125,136,214,246],"not,":[128],"provide":[130],"two":[131],"for":[133,160,186,242],"budget-constrained":[134],"iteration.":[142],"Denoting":[143],"time":[146,173,196],"VI,":[151],"input":[157],"U,":[159],"MDP":[162,249],"with":[163,236],"m":[164,198,219],"expected":[165],"constraints":[167],"our":[168,191],"first":[169],"runs":[171,194],"O(poly(m,":[174],"log":[175],"U)":[176,201],"\u00b7":[177,199,202,208],"VI).":[178],"Given":[179],"pre-specified":[181],"degree":[182],"precision,":[184],"\u03b7,":[185],"satisfying":[187],"constraints,":[190],"second":[192],"O(log":[197],"poly(log":[200],"(1/\u03b7":[203],"<sup":[204],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[205],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[206],")":[207],"VI),":[209],"but":[210],"produce":[212],"solutions":[213],"overutilize":[215],"each":[216],"budgets":[220],"multiplicative":[223],"factor":[224],"1":[226],"+":[227],"\u03b7.":[228],"fact,":[230],"one":[231],"can":[232],"substitute":[233],"any":[237],"algorithm,":[238],"possibly":[239],"specially":[240],"designed":[241],"specific":[244],"MDP,":[245],"solves":[247],"quickly":[250],"achieve":[252],"similar":[253],"theoretical":[254],"guarantees.":[255],"Both":[256],"restrict":[258],"attention":[259],"infinite-horizon":[262],"under":[264],"discounted":[265],"costs.":[266]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}