A Gradient-based Approach for Computing Nash Equilibria of Large Sequential Games
نویسندگان
چکیده
We propose a new gradient based scheme to approximate Nash equilibria of large sequential two-player, zero-sum games. The algorithm uses modern smoothing techniques for saddle-point problems tailored specifically for the polytopes used in the Nash equilibrium problem.
منابع مشابه
Local-Effect Games, and an Algorithm for Computing their Equilibria
There is much interest in modeling large, real-world problems as games and computing these games’ equilibria. This interest has driven recent advances in algorithms for computing Nash equilibria of general games. One recent, generalpurpose algorithm is the continuation method of Govindan and Wilson [2003], a gradient-following algorithm which is based on topological insight into the graph of th...
متن کاملGradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a first-order gradient method based on modern smoothing techniques for non-smooth convex optimization. The algorithm requires O(1/ ) iterations to compute an -equilibrium, and the work per iteration is extremely low. Thes...
متن کاملAn Empirical Study on Computing Equilibria in Polymatrix Games
The Nash equilibrium is an important benchmark for behaviour in systems of strategic autonomous agents. Polymatrix games are a succinct and expressive representation of multiplayer games that model pairwise interactions between players. The empirical performance of algorithms to solve these games has received little attention, despite their wide-ranging applications. In this paper we carry out ...
متن کاملProjected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...
متن کاملDiscrete Nondeterminism and Nash Equilibria for Strategy-Based Games
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium. Nash’s approach to the problem for strategic games is probabilistic, i.e. continuous, and static. CP and BR approaches for CP and BR games are discrete and dynami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007