A note on the complexity of determining optimal strategies in games with common payoffs
Year of publication: |
2003
|
---|---|
Authors: | Woeginger, Gerhard J. |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 58.2003, 2, p. 183-189
|
Publisher: |
Springer |
Subject: | Games | computational complexity | common payoffs |
-
A note on the complexity of determining optimal strategies in games with common payoffs
Woeginger, Gerhard J., (2003)
-
Gamification-as-innovation : a review
AlSaad, Fatemah M., (2021)
-
Novel Adaptive Exon Predictor for DNA Analysis Using Singular Value Decomposition
Putluri, Srinivasareddy, (2017)
- More ...
-
A note on the complexity of the bilevel bottleneck assignment problem
Fischer, Dennis, (2021)
-
The trouble with the second quantifier
Woeginger, Gerhard J., (2021)
-
An optimal algorithm for preemtive on-line scheduling
Chen, Bo, (1994)
- More ...