English
Related papers

Related papers: Properties and applications of dual reduction

200 papers

In this paper, we study the problem of finding mixed Nash equilibrium for mean-field two-player zero-sum games. Solving this problem requires optimizing over two probability distributions. We consider a quasistatic Wasserstein gradient flow…

Computer Science and Game Theory · Computer Science 2022-02-23 Chao Ma , Lexing Ying

The approximation of mixed Nash equilibria (MNE) for zero-sum games with mean-field interacting players has recently raised much interest in machine learning. In this paper we propose a mean-field gradient descent dynamics for finding the…

Optimization and Control · Mathematics 2025-05-13 Yulong Lu , Pierre Monmarché

Nash equilibrium is perhaps the best-known solution concept in game theory. Such a solution assigns a strategy to each player which offers no incentive to unilaterally deviate. While a Nash equilibrium is guaranteed to always exist, the…

Computer Science and Game Theory · Computer Science 2025-04-29 David Sychrovský , Christopher Solinas , Revan MacQueen , Kevin Wang , James R. Wright , Nathan R. Sturtevant , Michael Bowling

We propose a new class of games, called Multi-Games (MG), in which a given number of players play a fixed number of basic games simultaneously. In each round of the MG, each player will have a specific set of weights, one for each basic…

Computer Science and Game Theory · Computer Science 2012-06-27 Abbas Edalat , Ali Ghoroghi , Georgios Sakellariou

We study optimal behavior of energy producers under a CO_2 emission abatement program. We focus on a two-player discrete-time model where each producer is sequentially optimizing her emission and production schedules. The game-theoretic…

Optimization and Control · Mathematics 2010-08-24 Michael Ludkovski

The double oracle algorithm is a popular method of solving games, because it is able to reduce computing equilibria to computing a series of best responses. However, its theoretical properties are not well understood. In this paper, we…

Computer Science and Game Theory · Computer Science 2024-05-14 Brian Hu Zhang , Tuomas Sandholm

In this paper we define a new auction, called the Draw auction. It is based on the implementation of a draw when a minimum price of sale is not reached. We find that a Bayesian Nash equilibrium is reached in the Draw auction when each…

Computer Science and Game Theory · Computer Science 2024-03-14 Javier Castro , Rosa Espínola , Inmaculada Gutiérrez , Daniel Gómez

Starting from a heuristic learning scheme for N-person games, we derive a new class of continuous-time learning dynamics consisting of a replicator-like drift adjusted by a penalty term that renders the boundary of the game's strategy space…

Optimization and Control · Mathematics 2014-04-08 Pierre Coucheney , Bruno Gaujal , Panayotis Mertikopoulos

We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…

Computer Science and Game Theory · Computer Science 2010-01-28 Samaresh Chatterji , Ratnik Gandhi

We study the convergence to local Nash equilibria of gradient methods for two-player zero-sum differentiable games. It is well-known that such dynamics converge locally when $S \succ 0$ and may diverge when $S=0$, where $S\succeq 0$ is the…

Optimization and Control · Mathematics 2023-11-08 Guillaume Wang , Lénaïc Chizat

In this paper, a new method is proposed to compute the rolling Nash equilibrium of the time-invariant nonlinear two-person zero-sum differential games. The idea is to discretize the time to transform a differential game into a sequential…

Systems and Control · Electrical Eng. & Systems 2020-11-13 Wei Liao , Xiaohui Wei , Jizhou Lai

Repeated games consider a situation where multiple agents are motivated by their independent rewards throughout learning. In general, the dynamics of their learning become complex. Especially when their rewards compete with each other like…

Computer Science and Game Theory · Computer Science 2023-05-23 Yuma Fujimoto , Kaito Ariu , Kenshi Abe

We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…

Optimization and Control · Mathematics 2018-09-11 Atsuhiro Satoh , Yasuhito Tanaka

The goal of the paper is to develop the theory of finite state mean field games with major and minor players when the state space of the game is finite. We introduce the finite player games and derive a mean field game formulation in the…

Probability · Mathematics 2016-10-19 Rene Carmona , Peiqi Wang

Game-theoretic approaches and Nash equilibrium have been widely applied across various engineering domains. However, practical challenges such as disturbances, delays, and actuator limitations can hinder the precise execution of Nash…

Computer Science and Game Theory · Computer Science 2026-03-17 Mahdis Rabbani , Navid Mojahed , Shima Nazari

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

Computer Science and Game Theory · Computer Science 2016-07-13 Stéphane Le Roux , Arno Pauly

We study the connection between the evolutionary replicator dynamics and the number of Nash equilibria in large random bi-matrix games. Using techniques of disordered systems theory we compute the statistical properties of both, the fixed…

Populations and Evolution · Quantitative Biology 2015-06-26 Tobias Galla

In this paper, we investigate Nash equilibrium payoffs for nonzero-sum stochastic differential games with reflection. We obtain an existence theorem and a characterization theorem of Nash equilibrium payoffs for nonzero-sum stochastic…

Probability · Mathematics 2014-01-20 Qian Lin

In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…

Computer Science and Game Theory · Computer Science 2022-10-17 Yue Yu , Jonathan Salfity , David Fridovich-Keil , Ufuk Topcu

Real populations are seldom found at the Nash equilibrium strategy. The present work focuses on how population size can be a relevant evolutionary force diverting the population from its expected Nash equilibrium. We introduce the concept…

Computer Science and Game Theory · Computer Science 2025-06-24 Fabio A. C. C. Chalub , Max O. Souza