A note on the complexity of determining optimal strategies in games with common payoffs

Gerhard Woeginger

doi:10.1007/s001860300300

A note on the complexity of determining optimal strategies in games with common payoffs

Gerhard Woeginger

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

In a recent paper [Int J Game Theory (2001) 30:99–106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.

Original language	English
Pages (from-to)	183-189
Number of pages	7
Journal	Mathematical methods of operations research
Volume	58
Issue number	2
DOIs	https://doi.org/10.1007/s001860300300
Publication status	Published - 2003

Keywords

Computational Complexity
Games
IR-58666
METIS-213319
common payoffs

Access to Document

10.1007/s001860300300

Cite this

@article{2766eec32a744566a33dce29ad0a3bf7,

title = "A note on the complexity of determining optimal strategies in games with common payoffs",

abstract = "In a recent paper [Int J Game Theory (2001) 30:99–106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.",

keywords = "Computational Complexity, Games, IR-58666, METIS-213319, common payoffs",

author = "Gerhard Woeginger",

year = "2003",

doi = "10.1007/s001860300300",

language = "English",

volume = "58",

pages = "183--189",

journal = "Mathematical methods of operations research",

issn = "1432-2994",

publisher = "Physica-Verlag",

number = "2",

}

TY - JOUR

T1 - A note on the complexity of determining optimal strategies in games with common payoffs

AU - Woeginger, Gerhard

PY - 2003

Y1 - 2003

N2 - In a recent paper [Int J Game Theory (2001) 30:99–106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.

AB - In a recent paper [Int J Game Theory (2001) 30:99–106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.

KW - Computational Complexity

KW - Games

KW - IR-58666

KW - METIS-213319

KW - common payoffs

U2 - 10.1007/s001860300300

DO - 10.1007/s001860300300

M3 - Article

VL - 58

SP - 183

EP - 189

JO - Mathematical methods of operations research

JF - Mathematical methods of operations research

SN - 1432-2994

IS - 2

ER -

A note on the complexity of determining optimal strategies in games with common payoffs

Abstract

Keywords

Access to Document

Fingerprint

Cite this