Endogenous Networks in Random Population Games

Population learning in dynamic economies has been traditionally studied in over-simplified settings where payoff landscapes are very smooth. Indeed, in these models, all agents play the same bilateral stage-game against any opponent and stage-game payoffs reflect very simple strategic situations (e.g. coordination). In this paper, we address a preliminary investigation of dynamic population games over `rugged' landscapes, where agents face a strong uncertainty about expected payoffs from bilateral interactions. We propose a simple model where individual payoffs from playing a binary action against everyone else are distributed as a i.i.d. U[0,1] r.v.. We call this setting a `random population game' and we study population adaptation over time when agents can update both actions and partners using deterministic, myopic, best reply rules. We assume that agents evaluate payoffs associated to networks where an agent is not linked with everyone else by using simple rules (i.e. statistics) computed on the distributions of payoffs associated to all possible action combinations performed by agents outside the interaction set. We investigate the long-run properties of the system by means of computer simulations. We show that: (i) allowing for endogenous networks implies higher average payoff as compared to "frozen" networks; (ii) the statistics employed to evaluate payoffs strongly affect the efficiency of the system, i.e. convergence to a unique (multiple) steady-state(s) or not; (iii) for some class of statistics (e.g. MIN or MAX), the likelihood of efficient population learning strongly depends on whether agents are change-averse or not in discriminating between options delivering the same expected payoff.