Graph explorer

Sequential Naive Learning

We analyze boundedly rational updating from aggregate statistics in a model with binary actions and binary states. Agents each take an irreversible action in sequence after observing the unordered set of previous actions. Each agent first forms her prior based on the aggregate statistic, then incorporates her signal with the prior based on Bayes rule, and finally applies a decision rule that assigns a (mixed) action to each belief. If priors are formed according to a discretized DeGroot rule, then actions converge to the state (in probability), i.e., \emph{asymptotic learning}, in any informative information structure if and only if the decision rule satisfies probability matching. This result generalizes to unspecified information settings where information structures differ across agents and agents know only the information structure generating their own signal. Also, the main result extends to the case of $n$ states and $n$ actions.

6 nodes6 linksoverview previewSequential Naive Learning
6 nodes6 links
Sequential Naive Learning6 visible / 6 total nodes / 9 links
Related contextCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalWSequential Naive Learningpreprint / 2021AItai ArieliResearcherAYakov BabichenkoResearcherAManuel Mueller-FrankResearcherTMachine Learning49008 worksTComputer Science and Ga...1864 works
PaperSignal 105 links

Sequential Naive Learning

preprint / 2021

Open