Recent results on howard's algorithm

TY - GEN

T1 - Recent results on howard's algorithm

AU - Miltersen, P.B.

N1 - Conference code: 8

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84873865296&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36046-6_6

DO - 10.1007/978-3-642-36046-6_6

M3 - Article in proceedings

AN - SCOPUS:84873865296

SN - 9783642360442

T3 - Lecture Notes in Computer Science

SP - 53

EP - 56

BT - Mathematical and Engineering Methods in Computer Science

A2 - Kučera , Antonín

PB - Springer VS

T2 - Mathematical and Engineering Methods in Computer Science

Y2 - 25 October 2013 through 28 October 2013

ER -