Recent results on howard's algorithm

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Howard's algorithm is a fifty-year old generally applicable algorithm for sequential decision making in face of uncertainty. It is routinely used in practice in numerous application areas that are so important that they usually go by their acronyms, e.g., OR, AI, and CAV. While Howard's algorithm is generally recognized as fast in practice, until recently, its worst case time complexity was poorly understood. However, a surge of results since 2009 has led us to a much more satisfactory understanding of the worst case time complexity of the algorithm in the various settings in which it applies. In this talk, we shall survey these recent results and the open problems that remains.
Original languageEnglish
Title of host publicationMathematical and Engineering Methods in Computer Science : 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers
EditorsAntonín Kučera
Number of pages4
PublisherSpringer VS
Publication year2013
Pages53-56
ISBN (print)9783642360442
ISBN (Electronic)978-3-642-36046-6
DOIs
Publication statusPublished - 2013
EventMathematical and Engineering Methods in Computer Science - Znojmo, Czech Republic
Duration: 25 Oct 201328 Oct 2013
Conference number: 8

Conference

ConferenceMathematical and Engineering Methods in Computer Science
Nummer8
LandCzech Republic
ByZnojmo
Periode25/10/201328/10/2013
SeriesLecture Notes in Computer Science
Volume7721
ISSN0302-9743

See relations at Aarhus University Citationformats

ID: 62046776