A note on the complexity of determining optimal strategies in games with common payoffs
type: Item
instance of: scholarly article
title: A note on the complexity of determining optimal strategies in games with common payoffs
zbMATH Open document ID: 1069.91001
author: Gerhard J. Woeginger
published in: Mathematical Methods of Operations Research
publication date: 2003-12-16T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 91A06
Mathematics Subject Classification ID: 91A18
zbMATH DE Number: 2018323
zbMATH Keywords: Games
zbMATH Keywords: computational complexity
zbMATH Keywords: common payoffs
MaRDI profile type: Publication
full work available at URL: s001860300300
OpenAlex ID: W2112234116
DOI: 10.1007/S001860300300
Recommended article: On the NP-completeness of finding an optimal strategy in games with common payoffs
Recommended article: Simple strategies for large zero-sum games with applications to complexity theory
Recommended article: The complexity of mean payoff games
Recommended article: On the number of pure strategy Nash equilibria in finite common payoffs games
Recommended article: Complexity and Optimality of the Best Response Algorithm in Random Potential Games
Recommended article: Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
Recommended article: Simplifying Optimal Strategies in Stochastic Games
description: scientific article; zbMATH DE number 2018323