On Learning With Finite Memory
From MaRDI portal
Abstract: We consider an infinite collection of agents who make decisions, sequentially, about an unknown underlying binary state of the world. Each agent, prior to making a decision, receives an independent private signal whose distribution depends on the state of the world. Moreover, each agent also observes the decisions of its last K immediate predecessors. We study conditions under which the agent decisions converge to the correct value of the underlying state. We focus on the case where the private signals have bounded information content and investigate whether learning is possible, that is, whether there exist decision rules for the different agents that result in the convergence of their sequence of individual decisions to the correct state of the world. We first consider learning in the almost sure sense and show that it is impossible, for any value of K. We then explore the possibility of convergence in probability of the decisions to the correct state. Here, a distinction arises: if K equals 1, learning in probability is impossible under any decision rule, while for K greater or equal to 2, we design a decision rule that achieves it. We finally consider a new model, involving forward looking strategic agents, each of which maximizes the discounted sum (over all agents) of the probabilities of a correct decision. (The case, studied in previous literature, of myopic agents who maximize the probability of their own decision being correct is an extreme special case.) We show that for any value of K, for any equilibrium of the associated Bayesian game, and under the assumption that each private signal has bounded information content, learning in probability fails to obtain.
Recommendations
- Learning with Finite Memory
- Learning with bounded memory in stochastic models
- Classification With Finite Memory Revisited
- Classification with finite memory
- Learning with bounded memory in games
- Learning in games with bounded memory
- From learning in the limit to stochastic finite learning
- scientific article; zbMATH DE number 2083808
- Learning via finitely many queries
Cited in
(9)- On the asymptotic behaviour of linear learning processes with partial forgetting
- How fragile are information cascades?
- Learning with Temporary Memory
- Incremental Learning with Ordinal Bounded Example Memory
- Learning with ordinal-bounded memory from positive data
- On sequential strategies for loss functions with memory
- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
- Learning with Finite Memory
- Learning with bounded memory in stochastic models
This page was built for publication: On Learning With Finite Memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346329)
