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

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

0.00 Avg rating0 Votes
Article ID: iaor20051015
Country: Germany
Volume: 58
Issue: 2
Start Page Number: 183
End Page Number: 189
Publication Date: Jan 2003
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors:
Abstract:

In a recent paper, 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.

Reviews

Required fields are marked *. Your email address will not be published.