Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning

10/01/2019
by   Sam Ganzfried, et al.
0

Many real-world domains contain multiple agents behaving strategically with probabilistic transitions and uncertain (potentially infinite) duration. Such settings can be modeled as stochastic games. While algorithms have been developed for solving (i.e., computing a game-theoretic solution concept such as Nash equilibrium) two-player zero-sum stochastic games, research on algorithms for non-zero-sum and multiplayer stochastic games is very limited. We present a new algorithm for these settings, which constitutes the first parallel algorithm for multiplayer stochastic games. We present experimental results on a 4-player stochastic game motivated by a naval strategic planning scenario, showing that our algorithm is able to quickly compute strategies constituting Nash equilibrium up to a very small degree of approximation.

READ FULL TEXT

page 3

page 4

research
10/26/2020

Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information

Many important real-world settings contain multiple players interacting ...
research
06/12/2020

Algorithm for Computing Approximate Nash equilibrium in Continuous Games with Application to Continuous Blotto

Successful algorithms have been developed for computing Nash equilibrium...
research
05/13/2014

Algorithm Instance Games

This paper introduces algorithm instance games (AIGs) as a conceptual cl...
research
06/12/2020

Secure Route Planning Using Dynamic Games with Stopping States

We consider the classic motion planning problem defined over a roadmap i...
research
06/02/2019

Feature-Based Q-Learning for Two-Player Stochastic Games

Consider a two-player zero-sum stochastic game where the transition func...
research
04/04/2022

The Parking Problem: A Game-Theoretic Solution

In this paper, we propose a game-theoretic solution to the parking probl...
research
03/26/2021

Evolutionary Strategies with Analogy Partitions in p-guessing Games

In Keynesian Beauty Contests notably modeled by p-guessing games, player...

Please sign up or login with your details

Forgot password? Click here to reset