Evolutionary games and matching rules

12Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

This study considers evolutionary games with non-uniformly random matching when interaction occurs in groups of n≥ 2 individuals using pure strategies from a finite strategy set. In such models, groups with different compositions of individuals generally co-exist and the reproductive success (fitness) of a specific strategy varies with the frequencies of different group types. These frequencies crucially depend on the matching process. For arbitrary matching processes (called matching rules), we study Nash equilibrium and ESS in the associated population game and show that several results that are known to hold for population games under uniform random matching carry through to our setting. In our most novel contribution, we derive results on the efficiency of the Nash equilibria of population games and show that for any (fixed) payoff structure, there always exists some matching rule leading to average fitness maximization. Finally, we provide a series of applications to commonly studied normal-form games.

Cite

CITATION STYLE

APA

Jensen, M. K., & Rigos, A. (2018). Evolutionary games and matching rules. International Journal of Game Theory, 47(3), 707–735. https://doi.org/10.1007/s00182-018-0630-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free