AI Chat AI Image Generator AI Video Text to Speech

The Complexity of SPEs in Mean-payoff Games

02/17/2022

∙

by Léonard Brice, et al.

∙

∙

We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst case complexity was left open.

Léonard Brice
5 publications
Jean-François Raskin
38 publications
Marie Van den Bogaard
9 publications

page 1

page 2

page 3

page 4

research

∙ 12/08/2021

The Complexity of the Hausdorff Distance

We investigate the computational complexity of computing the Hausdorff d...

0 Paul Jungeblut, et al. ∙

research

∙ 05/21/2020

Hardness of Modern Games

We consider the complexity properties of modern puzzle games, Hexiom, Cu...

0 Diogo M. Costa, et al. ∙

research

∙ 11/06/2014

Proof Supplement - Learning Sparse Causal Models is not NP-hard (UAI2013)

This article contains detailed proofs and additional examples related to...

0 Tom Claassen, et al. ∙

research

∙ 01/27/2023

A Characterization of Complexity in Public Goods Games

We complete the characterization of the computational complexity of equi...

0 Matan Gilboa, et al. ∙

research

∙ 09/08/2015

On the complexity of piecewise affine system identification

The paper provides results regarding the computational complexity of hyb...

0 Fabien Lauer, et al. ∙

research

∙ 03/16/2022

Subgame-perfect Equilibria in Mean-payoff Games (journal version)

In this paper, we provide an effective characterization of all the subga...

0 Léonard Brice, et al. ∙

research

∙ 11/06/2019

Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation

In this paper we propose the first correct poly-time algorithm for exact...

0 Chuyang Ke, et al. ∙