On the computational complexity of decision problems about multi-player Nash equilibria
From MaRDI portal
Publication:5919366
DOI10.1007/978-3-030-30473-7_11zbMath1431.91073arXiv2001.05196OpenAlexW2972563375MaRDI QIDQ5919366
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
Publication date: 4 February 2020
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.05196
(n)-person games, (n>2) (91A06) Decision theory for games (91A35) Algorithmic game theory and complexity (91A68)
Related Items
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Unnamed Item ⋮ On the computational complexity of decision problems about multi-player Nash equilibria ⋮ Computational complexity of multi-player evolutionarily stable strategies
