English
Related papers

Related papers: Natural Selection between Two Games and Replicator…

200 papers

A periodic behavior is a well observed phenomena in biological and economical systems. We show that evolutionary games on graphs with imitation dynamics can display periodic behavior for an arbitrary choice of game theoretical parameters…

Dynamical Systems · Mathematics 2018-05-11 Jeremias Epperlein , Vladimír Švígler

Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity…

Multiagent Systems · Computer Science 2021-01-08 Joseph Singleton , Richard Booth

We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…

Populations and Evolution · Quantitative Biology 2014-05-19 Hyeong-Chai Jeong , Seung-Yoon Oh , Benjamin Allen , Martin A. Nowak

In some scenarios ("anti-coordination games"), individuals are better off choosing different actions than their neighbors while in other scenarios ("coordination games"), it is beneficial for individuals to choose the same strategy as their…

Physics and Society · Physics 2021-12-08 Matthew I. Jones , Scott D. Pauls , Feng Fu

One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes…

Computer Science and Game Theory · Computer Science 2013-04-09 Sunil Simon , Krzysztof R. Apt

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…

Computational Complexity · Computer Science 2012-02-06 Nathanaël Fijalkow , Florian Horn

Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games…

Computer Science and Game Theory · Computer Science 2014-01-24 Romain Brenguier , Jean-François Raskin , Mathieu Sassolas

Communities typically capture homophily as people of the same community share many common features. This paper is motivated by the problem of community detection in social networks, as it can help improve our understanding of the network…

Computer Science and Game Theory · Computer Science 2017-09-01 Radhika Arava

We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are…

Discrete Mathematics · Computer Science 2026-04-08 David Auger , Johanne Cohen , Antoine Lobstein

We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…

Computer Science and Game Theory · Computer Science 2026-01-13 Sarvin Bahmani , Rasmus Ibsen-Jensen , Soumyajit Paul , Sven Schewe , Friedrich Slivovsky , Qiyi Tang , Dominik Wojtczak , Shufang Zhu

In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…

Computer Science and Game Theory · Computer Science 2025-01-31 A. Kaan Ata Yilmaz , Abhishek Kulkarni , Ufuk Topcu

We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity…

Computational Complexity · Computer Science 2015-12-12 Matthias Mnich , Heiko Röglin , Clemens Rösner

Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals. A common assumption in evolutionary game theory is that interactions are symmetric, which means that the players are…

Populations and Evolution · Quantitative Biology 2016-05-04 Alex McAvoy , Christoph Hauert

We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on…

Computer Science and Game Theory · Computer Science 2016-11-30 Sunil Simon , Dominik Wojtczak

Evolutionary game theory classically investigates which behavioral patterns are evolutionarily successful in a single game. More recently, a number of contributions have studied the evolution of preferences instead: which subjective…

Computer Science and Game Theory · Computer Science 2015-05-27 Paolo Galeazzi , Michael Franke

We propose a simple model of network co-evolution in a game-dynamical system of interacting agents that play repeated games with their neighbors, and adapt their behaviors and network links based on the outcome of those games. The…

Computer Science and Game Theory · Computer Science 2011-07-28 Aram Galstyan , Ardeshir Kianercy , Armen Allahverdyan

Game theoretic tools are utilized to analyze a one-locus continuous selection model of sex-specific meiotic drive by considering nonequivalence of the viabilities of reciprocal heterozygotes that might be noticed at an imprinted locus. The…

Populations and Evolution · Quantitative Biology 2015-12-07 Bijan Sarkar

Learning problems commonly exhibit an interesting feedback mechanism wherein the population data reacts to competing decision makers' actions. This paper formulates a new game theoretic framework for this phenomenon, called "multi-player…

Computer Science and Game Theory · Computer Science 2022-04-08 Adhyyan Narang , Evan Faulkner , Dmitriy Drusvyatskiy , Maryam Fazel , Lillian J. Ratliff

We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this paper we consider the scenario when Maker plays randomly and Breaker is "clever", and…

Combinatorics · Mathematics 2016-04-01 Jonas Groschwitz , Tibor Szabó

We present a unified approach, based on dominating families in binary relations, for the study of topological properties defined in terms of selection principles and the games associated to them.

General Topology · Mathematics 2014-05-21 Rodrigo R. Dias , Marion Scheepers