Evolutionary dynamics of Lewis signaling games: signaling systems vs. partial pooling

Transfer of information between senders and receivers, of one kind or another, is essential to all life. David Lewis introduced a game theoretic model of the simplest case, where one sender and one receiver have pure common interest. How hard or easy is it for evolution to achieve information transfer in Lewis signaling?. The answers involve surprising subtleties. We discuss some if these in terms of evolutionary dynamics in both finite and infinite populations, with and without mutation

Inventing new signals

Amodel for inventing newsignals is introduced in the context of sender–receiver games with reinforcement learning. If the invention parameter is set to zero, it reduces to basic Roth–Erev learning applied to acts rather than strategies, as in Argiento et al. (Stoch. Process. Appl. 119:373–390, 2009). If every act is uniformly reinforced in every state it reduces to the Chinese Restaurant Process—also known as the Hoppe–Pólya urn—applied to each act. The dynamics can move players from one signaling game to another during the learning process. Invention helps agents avoid pooling and partial pooling equilibria