∃R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games

被引：8
|
作者：
Bilo, Vittorio [1 ]
Mavronicolas, Marios [2 ]
机构：
[1] Univ Salento, Dept Math & Phys, Lecce, Italy
[2] Univ Cyprus, Dept Comp Sci, Nicosia, Cyprus
来源：
34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017) | 2017年 / 66卷
关键词：
Nash equilibrium; complexity of equilibria; there exists R-completeness; APPROXIMATE;
D O I：
10.4230/LIPIcs.STACS.2017.13
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the complexity of decision problems about symmetric Nash equilibria for symmetric multi-player games. These decision problems concern the existence of a symmetric Nash equilibrium with certain natural properties. We show that a handful of such decision problems are there exists R-complete; that is, they are exactly as hard as deciding the Existential Theory of the Reals.
引用
收藏
页数：14
相关论文
共 50 条
  • [1] ∃R-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games
    Bilo, Vittorio
    Mavronicolas, Marios
    [J]. ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2021, 9 (03)
  • [2] A Catalog of ∃R-Complete Decision Problems About Nash Equilibria in Multi-Player Games
    Bilo, Vittorio
    Mavronicolas, Marios
    [J]. 33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [3] there exists R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria
    Garg, Jugal
    Mehta, Ruta
    Vazirani, Vijay V.
    Yazdanbod, Sadra
    [J]. ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION, 2018, 6 (01)
  • [4] ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
    Garg, Jugal
    Mehta, Ruta
    Vazirani, Vijay V.
    Yazdanbod, Sadra
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 554 - 566
  • [5] On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
    Berthelsen, Marie Louisa Tolboll
    Hansen, Kristoffer Arnsfelt
    [J]. ALGORITHMIC GAME THEORY (SAGT 2019), 2019, 11801 : 153 - 167
  • [6] On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
    Marie Louisa Tølbøll Berthelsen
    Kristoffer Arnsfelt Hansen
    [J]. Theory of Computing Systems, 2022, 66 : 519 - 545
  • [7] On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
    Berthelsen, Marie Louisa Tolboll
    Hansen, Kristoffer Arnsfelt
    [J]. THEORY OF COMPUTING SYSTEMS, 2022, 66 (03) : 519 - 545
  • [8] Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games
    Bilo, Vittorio
    Hansen, Kristoffer Arnsfelt
    Mavronicolas, Marios
    [J]. ALGORITHMIC GAME THEORY, SAGT 2023, 2023, 14238 : 40 - 57
  • [9] Approximate nash equilibria for multi-player games
    Hemon, Sbastien
    de Rougemont, Michel
    Santha, Miklos
    [J]. ALGORITHMIC GAME THEORY, PROCEEDINGS, 2008, 4997 : 267 - 278
  • [10] Nash Equilibria Detection for Multi-Player Games
    Lung, Rodica Ioana
    Mihoc, Tudor Dan
    Dumitrescu, D.
    [J]. 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
12345