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

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. Copyright Springer-Verlag 2003

MoreLess

Year of publication:	2003
Authors:	Woeginger, Gerhard J.
Published in:	Computational Statistics. - Springer. - Vol. 58.2003, 2, p. 183-189
Publisher:	Springer
Subject:	Games \| computational complexity \| common payoffs

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010759485