English
Related papers

Related papers: Natural Selection between Two Games and Replicator…

200 papers

We study repeated games where players use an exponential learning scheme in order to adapt to an ever-changing environment. If the game's payoffs are subject to random perturbations, this scheme leads to a new stochastic version of the…

Probability · Mathematics 2010-10-22 Panayotis Mertikopoulos , Aris L. Moustakas

We explore the evolutionary dynamics of two games - the Prisoner's Dilemma and the Snowdrift Game - played within distinct networks (layers) of interdependent networks. In these networks imitation and interaction between individuals of…

Physics and Society · Physics 2014-04-10 M. D. Santos , S. N. Dorogovtsev , J. F. F. Mendes

Graphs and networks are common ways of depicting biological information. In biology, many different biological processes are represented by graphs, such as regulatory networks, metabolic pathways and protein--protein interaction networks.…

Applications · Statistics 2010-11-16 Caiyan Li , Hongzhe Li

Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a matching. In this paper, we define a generalized game called…

Data Structures and Algorithms · Computer Science 2022-11-11 Tesshu Hanaka , Hironori Kiya , Hirotaka Ono , Kanae Yoshiwatari

We discuss stochastic dynamics of populations of individuals playing games. Our models possess two evolutionarily stable strategies: an efficient one, where a population is in a state with the maximal payoff (fitness) and a risk-dominant…

Populations and Evolution · Quantitative Biology 2007-05-23 Jacek Miekisz

Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial…

This paper describes a new algorithm for decision making in two-player real-time video games. As with Monte Carlo Tree Search, the algorithm can be used without heuristics and has been developed for use in general video game AI. The…

Artificial Intelligence · Computer Science 2016-07-07 Jialin Liu , Diego Pérez-Liébana , Simon M. Lucas

Evolutionary game dynamics with two 2-strategy games in a finite population has been investigated in this study. Traditionally, frequency-dependent evolutionary dynamics are modeled by deterministic replicator dynamics under the assumption…

Populations and Evolution · Quantitative Biology 2013-06-03 Koh Hashimoto

We present a model that takes into account the coupling between evolutionary game dynamics and social influence. Importantly, social influence and game dynamics take place in different domains, which we model as different layers of a…

Physics and Society · Physics 2017-02-22 Roberta Amato , Albert Díaz-Guilera , Kaj-Kolja Kleineberg

This paper studies the finite-time horizon Markov games where the agents' dynamics are decoupled but the rewards can possibly be coupled across agents. The policy class is restricted to local policies where agents make decisions using their…

Computer Science and Game Theory · Computer Science 2023-04-11 Runyu Zhang , Yuyang Zhang , Rohit Konda , Bryce Ferguson , Jason Marden , Na Li

The ability to inferring latent psychological traits from human behavior is key to developing personalized human-interacting machine learning systems. Approaches to infer such traits range from surveys to manually-constructed experiments…

Machine Learning · Computer Science 2019-12-13 Fan Yang , Liu Leqi , Yifan Wu , Zachary C. Lipton , Pradeep Ravikumar , William W. Cohen , Tom Mitchell

A common assumption employed in most previous works on evolutionary game dynamics is that every individual player has full knowledge about and full access to the complete set of available strategies. In realistic social, economical, and…

Adaptation and Self-Organizing Systems · Physics 2018-11-14 Jun-Jie Jiang , Yu-Zhong Chen , Zi-Gang Huang , Ying-Cheng Lai

We consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence…

Probability · Mathematics 2018-01-25 Sylvain Delattre , Nicolas Fournier

In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…

Optimization and Control · Mathematics 2017-07-25 Dario Bauso , Jian Gao , Hamidou Tembine

Online games are the most popular form of entertainment among youngsters as well as elders. Recognized as e-Sports, they may become an official part of the Olympic Games by 2020. However, a long waiting time for matchmaking will largely…

Performance · Computer Science 2019-11-28 Mingkuan Xu , Yang Yu , Chenye Wu

The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-20 Jean-François Marckert , Nasser Saheb-Djahromi , Akka Zemmari

Selection in a time-periodic environment is modeled via the two-player replicator dynamics. For sufficiently fast environmental changes, this is reduced to a multi-player replicator dynamics in a constant environment. The two-player terms…

Populations and Evolution · Quantitative Biology 2015-05-13 Armen E. Allahverdyan , Chin-Kun Hu

Game theory provides a quantitative framework for analyzing the behavior of rational agents. The Iterated Prisoner's Dilemma in particular has become a standard model for studying cooperation and cheating, with cooperation often emerging as…

Populations and Evolution · Quantitative Biology 2015-06-18 Alexander J. Stewart , Joshua B. Plotkin

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…

Combinatorics · Mathematics 2023-07-11 Paweł Prałat , Harjas Singh