Verifiability and neologism-proofness in a Sender–Receiver game
✍ Scribed by Matthew Ryan; Rhema Vaithianathan
- Book ID
- 116635888
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 540 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0167-2681
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract This paper compares stimulus response (SR) and belief‐based learning (BBL) using data from experiments with sender–receiver games. The environment, extensive form games played in a population setting, is novel in the empirical literature on learning in games. Both the SR and BBL models
We use a genetic algorithm to simulate play of a sender/receiver game of common interest in which players engage in anonymous, pairwise interactions. The order of an equilibrium is the number of player types that are communicated. There are many equilibria of each order, equilibria of the same order