English
Related papers

Related papers: A General Upper Bound for the Runtime of a Coevolu…

200 papers

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

Iterated coopetitive games capture the situation when one must efficiently balance between cooperation and competition with the other agents over time in order to win the game (e.g., to become the player with highest total utility).…

Computer Science and Game Theory · Computer Science 2022-03-11 Shivakumar Mahesh , Nicholas Bishop , Le Cong Dinh , Long Tran-Thanh

We study the iteration complexity of decentralized learning of approximate correlated equilibria in incomplete information games. On the negative side, we prove that in $\mathit{extensive}$-$\mathit{form}$ $\mathit{games}$, assuming…

Computer Science and Game Theory · Computer Science 2024-06-05 Binghui Peng , Aviad Rubinstein

In this paper, we study analytically the statistics of the number of equilibria in pairwise social dilemma evolutionary games with mutation where a game's payoff entries are random variables. Using the replicator-mutator equations, we…

Populations and Evolution · Quantitative Biology 2021-09-15 Manh Hong Duong , The Anh Han

The theory of learning in games has extensively studied situations where agents respond dynamically to each other by optimizing a fixed utility function. However, in real situations, the strategic environment varies as a result of past…

Computer Science and Game Theory · Computer Science 2022-07-15 Brandon C. Collins , Shouhuai Xu , Philip N. Brown

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

Combinatorics · Mathematics 2021-07-07 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

We study a multi-agent decision problem in population games, where agents select from multiple available strategies and continually revise their selections based on the payoffs associated with these strategies. Unlike conventional…

Multiagent Systems · Computer Science 2024-09-17 Shinkyu Park

Evolutionary game theory has been a successful tool to combine classical game theory with learning-dynamical descriptions in multiagent systems. Provided some symmetric structures of interacting players, many studies have been focused on…

Artificial Intelligence · Computer Science 2022-06-23 Xinyu Zhang , Peng Peng , Yushan Zhou , Haifeng Wang , Wenxin Li

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

Game theory offers a powerful framework for analyzing strategic interactions among decision-makers, providing tools to model, analyze, and predict their behavior. However, implementing game theory can be challenging due to difficulties in…

Computer Science and Game Theory · Computer Science 2024-05-15 Yaoqi Yang , Hongyang Du , Geng Sun , Zehui Xiong , Dusit Niyato , Zhu Han

Partial monitoring games are repeated games where the learner receives feedback that might be different from adversary's move or even the reward gained by the learner. Recently, a general model of combinatorial partial monitoring (CPM)…

Computer Science and Game Theory · Computer Science 2016-08-24 Sougata Chaudhuri , Ambuj Tewari

This paper describes three different optimised implementations of playouts, as commonly used by game-playing algorithms such as Monte-Carlo Tree Search. Each of the optimised implementations is applicable only to specific sets of games,…

Artificial Intelligence · Computer Science 2021-11-05 Dennis J. N. J. Soemers , Éric Piette , Matthew Stephenson , Cameron Browne

Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of the classic Weighted Vertex Cover problem and analyze the…

Neural and Evolutionary Computing · Computer Science 2020-01-27 Feng Shi , Frank Neumann , Jianxin Wang

One hope when using non-elitism in evolutionary computation is that the ability to abandon the current-best solution aids leaving local optima. To improve our understanding of this mechanism, we perform a rigorous runtime analysis of a…

Neural and Evolutionary Computing · Computer Science 2022-06-17 Benjamin Doerr

In this work we assess the role played by the dynamical adaptation of the interactions network, among agents playing Coordination Games, in reaching global coordination and in the equilibrium selection. Specifically, we analyze a…

Physics and Society · Physics 2023-02-20 Miguel A. González Casado , Angel Sánchez , Maxi San Miguel

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…

Planning safe robot motions in the presence of humans requires reliable forecasts of future human motion. However, simply predicting the most likely motion from prior interactions does not guarantee safety. Such forecasts fail to model the…

Artificial Intelligence · Computer Science 2023-10-23 Kushal Kedia , Prithwish Dan , Sanjiban Choudhury

Evolutionary game theory has proved to be a powerful tool to probe the self-organisation of collective behaviour by considering frequency-dependent fitness in evolutionary processes. It has shown that the stability of a strategy depends not…

Populations and Evolution · Quantitative Biology 2023-01-11 Diogo L. Pires , Mark Broom

We address safe multi-robot interaction under uncertainty. In particular, we formulate a chance-constrained linear quadratic Gaussian game with coupling constraints and system uncertainties. We find a tractable reformulation of the game and…

Robotics · Computer Science 2025-08-15 Kai Ren , Giulio Salizzoni , Mustafa Emre Gürsoy , Maryam Kamgarpour

Dynamic nonzero sum games are widely used to model multi agent decision making in control, economics, and related fields. Classical methods for computing Nash equilibria, especially in linear quadratic settings, rely on strong structural…

Neural and Evolutionary Computing · Computer Science 2026-01-07 Alireza Rezaee