Munich Personal RePEc Archive

Learning in hidden Markov models with bounded memory

Monte, Daniel and Said, Maher (2010): Learning in hidden Markov models with bounded memory.

WarningThere is a more recent version of this item available.
[img]
Preview
PDF
MPRA_paper_23854.pdf

Download (198kB) | Preview

Abstract

This paper explores the role of memory in decision making in dynamic environments. We examine the inference problem faced by an agent with bounded memory who receives a sequence of signals from a hidden Markov model. We show that the optimal symmetric memory rule may be deterministic. This result contrasts sharply with Hellman and Cover (1970) and Wilson (2004) and solves, for the context of a hidden Markov model, an open question posed by Kalai and Solan (2003).

Available Versions of this Item

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.