Computational Complexity of Multi-Player Evolutionarily Stable Strategies

03/14/2022
by   Manon Blanc, et al.
0

In this paper we study the computational complexity of computing an evolutionary stable strategy (ESS) in multi-player symmetric games. For two-player games, deciding existence of an ESS is complete for Σ 2 , the second level of the polynomial time hierarchy. We show that deciding existence of an ESS of a multi-player game is closely connected to the second level of the real polynomial time hierarchy. Namely, we show that the problem is hard for a complexity class we denote as ∃D . ∀R and is a member of ∃∀R, where the former class restrict the latter by having the existentially quantified variables be Boolean rather then real-valued. As a special case of our results it follows that deciding whether a given strategy is an ESS is complete for ∀R. A concept strongly related to ESS is that of a locally superior strategy (LSS). We extend our results about ESS and show that deciding existence of an LSS of a multiplayer game is likewise hard for ∃D ∀R and a member of ∃∀R, and as a special case that deciding whether a given strategy is an LSS is complete for ∀R.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2020

On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria

We study the computational complexity of decision problems about Nash eq...
research
02/25/2019

On One-Round Discrete Voronoi Games

Let V be a multiset of n points in R^d, which we call voters, and let k≥...
research
07/12/2022

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy

We prove that deciding the vanishing of the character of the symmetric g...
research
06/30/2021

Backgammon is Hard

We study the computational complexity of the popular board game backgamm...
research
11/18/2019

On the Complexity of 2-Player Packing Games

We analyze the computational complexity of two 2-player games involving ...
research
05/06/2018

The Exact Computational Complexity of Evolutionarily Stable Strategies

While the computational complexity of many game-theoretic solution conce...
research
08/23/2023

Network Navigation with Online Delays is PSPACE-complete

In public transport networks disruptions may occur and lead to travel de...

Please sign up or login with your details

Forgot password? Click here to reset