Related papers: Sharp benefit-to-cost rules for the evolution of c…
Evolutionary prisoner's dilemma games are studied with players located on square lattice and random regular graphs defining four neighbors for each one. The players follow one of the three strategies: tit-for-tat, unconditional cooperation,…
Evolutionary dynamics on graphs can lead to many interesting and counterintuitive findings. We study the Moran process, a discrete time birth-death process, that describes the invasion of a mutant type into a population of wild-type…
In this paper, we study Ranking, a well-known randomized greedy matching algorithm, for general graphs. The algorithm was originally introduced by Karp, Vazirani, and Vazirani [STOC 1990] for the online bipartite matching problem with…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
Evolution in finite populations is often modelled using the classical Moran process. Over the last ten years this methodology has been extended to structured populations using evolutionary graph theory. An important question in any such…
One of the most fundamental concepts of evolutionary dynamics is the "fixation" probability, i.e. the probability that a mutant spreads through the whole population. Most natural communities are geographically structured into habitats…
This paper is concerned with the death-birth updating process. This model is an example of a spatial game in which players located on the~$d$-dimensional integer lattice are characterized by one of two possible strategies and update their…
We investigate spatial evolutionary games with death-birth updating in large finite populations. Within growing spatial structures subject to appropriate conditions, the density processes of a fixed type are proven to converge to the…
The multi-type Moran process is an evolutionary process on a connected graph $G$ in which each vertex has one of $k$ types and, in each step, a vertex $v$ is chosen to reproduce its type to one of its neighbours. The probability of a vertex…
A central question of evolutionary dynamics on graphs is whether or not a mutation introduced in a population of residents survives and eventually even spreads to the whole population, or gets extinct. The outcome naturally depends on the…
We study dynamic $(1-\epsilon)$-approximate rounding of fractional matchings -- a key ingredient in numerous breakthroughs in the dynamic graph algorithms literature. Our first contribution is a surprisingly simple deterministic rounding…
We investigate the effects of update rules on the dynamics of an evolutionary game-theoretic model - the N-player evolutionary trust game - consisting of three types of players: investors, trustworthy trustees, and untrustworthy trustees.…
Evolutionary graph theory is a well established framework for modelling the evolution of social behaviours in structured populations. An emerging consensus in this field is that graphs that exhibit heterogeneity in the number of connections…
Evolutionary graph theory is the study of evolutionary dynamics in structured populations. A well-known problem in evolutionary graph theory is that the spread of mutation (measured by fixation probability) is impacted by the graph type…
Convergence of discrete-time Markov chains with two timescales is a powerful tool to study stochastic evolutionary games in subdivided populations. Focusing on linear games within demes, convergence to a diffusion process for the strategy…
We consider a generalized version of the birth-death (BD) and death-birth (DB) processes introduced by Kaveh, Komarova, and Kohandel (2015), in which two constant fitnesses, one for birth and the other for death, describe the selection…
Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established…
The commonly used accumulated payoff scheme is not invariant with respect to shifts of payoff values when applied locally in degree-inhomogeneous population structures. We propose a suitably modified payoff scheme and we show both formally…
We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether to cooperate or defect in a repeated game. The players…
We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from…