Data Structures for Deviation Payoffs

02/26/2023
by   Bryce Wiedenbeck, et al.
0

We present new data structures for representing symmetric normal-form games. These data structures are optimized for efficiently computing the expected utility of each unilateral pure-strategy deviation from a symmetric mixed-strategy profile. The cumulative effect of numerous incremental innovations is a dramatic speedup in the computation of symmetric mixed-strategy Nash equilibria, making it practical to represent and solve games with dozens to hundreds of players. These data structures naturally extend to role-symmetric and action-graph games with similar benefits.

READ FULL TEXT

page 3

page 18

page 20

page 21

research
12/13/2021

On Nash Equilibria in Normal-Form Games With Vectorial Payoffs

We provide an in-depth study of Nash equilibria in multi-objective norma...
research
02/25/2023

Learning Parameterized Families of Games

Nearly all simulation-based games have environment parameters that affec...
research
04/17/2019

Berge equilibria in n-person 2-strategy games

An algorithm for finding all Berge equilibria in the sense of Zhukovskii...
research
07/07/2022

For Learning in Symmetric Teams, Local Optima are Global Nash Equilibria

Although it has been known since the 1970s that a globally optimal strat...
research
07/15/2020

Efficiency of equilibria in random binary games

We consider normal-form games with n players and two strategies for each...
research
08/28/2018

A Short Note on Collecting Dependently Typed Values

Within dependently typed languages, such as Idris, types can depend on v...
research
12/14/2017

Equilibria in the Tangle

We analyse the Tangle --- a DAG-valued stochastic process where new vert...

Please sign up or login with your details

Forgot password? Click here to reset