相关论文: Sharp benefit-to-cost rules for the evolution of c…

We study mechanisms of synchronisation, coordination, and equilibrium selection in two-player coordination games on multilayer networks. We apply the approach from evolutionary game theory with three possible update rules: the replicator…

We consider the classic Moran process modeling the spread of genetic mutations, as extended to structured populations by Lieberman et al.\ (Nature, 2005). In this process, individuals are the vertices of a connected graph $G$. Initially,…

We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…

Spatial structure is one of the simplest and most studied ecological factors that affect the evolution of cooperation. It has been shown that spatial reciprocity promotes cooperation due to the formation of cooperative clusters, which…

Learning from a partner who collects higher payoff is a frequently used working hypothesis in evolutionary game theory. One of the alternative dynamical rules is when the focal player prefers to follow the strategy choice of the majority in…

We extend the general stochastic matching model on graphs introduced in (Mairesse and Moyal, 2016), to matching models on multigraphs, that is, graphs with self-loops. The evolution of the model can be described by a discrete time Markov…

We consider the problem of maintaining an approximate maximum integral matching in a dynamic graph $G$, while the adversary makes changes to the edges of the graph. The goal is to maintain a $(1+\epsilon)$-approximate maximum matching for…

Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and computation of equilibria, under various notions of…

We have studied an evolutionary prisoner's dilemma game with players located on two types of random regular graphs with a degree of 4. The analysis is focused on the effects of payoffs and noise (temperature) on the maintenance of…

Evolutionary graph theory has grown to be an area of intense study. Despite the amount of interest in the field, it seems to have grown separate from other subfields of population genetics and evolution. In the current work I introduce the…

We study the fixation probability of a mutant type when introduced into a resident population. As opposed to the usual assumption of constant pop- ulation size, we allow for stochastically varying population sizes. This is implemented by a…

Evolutionary game theory is a powerful mathematical framework to study how intelligent individuals adjust their strategies in collective interactions. It has been widely believed that it is impossible to unilaterally control players'…

We study the scaling limit of a large class of voter model perturbations in one dimension, including stochastic Potts models, to a universal limiting object, the continuum voter model perturbation. The perturbations can be described in…

We study evolutionary dynamics on graphs in which each step consists of one birth and one death, also known as the Moran processes. There are two types of individuals: residents with fitness $1$ and mutants with fitness $r$. Two standard…

Evolutionary game dynamics in structured populations has been extensively explored in past decades. However, most previous studies assume that payoffs of individuals are fully determined by the strategic behaviors of interacting parties and…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second…

Probabilistic graphical models, such as Markov random fields (MRF), exploit dependencies among random variables to model a rich family of joint probability distributions. Sophisticated inference algorithms, such as belief propagation (BP),…

Graphs are a standard framework for describing dynamical processes shaped by pairwise interactions among agents. But many systems involve interactions in groups of three or more agents. Here, we develop a method of "$\ell$-hyperedge…

Pairwise Markov Random Fields (MRFs) or undirected graphical models are parsimonious representations of joint probability distributions. Variables correspond to nodes of a graph, with edges between nodes corresponding to conditional…