We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

We call a correspondence, defined on the set of mixed strategy proles, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy prole, and (4) is convex- and closed-valued. For each generalized...