"On the NP-completeness of finding an optimal strategy in games with common ..."

Francis C. Chu, Joseph Y. Halpern (2001)

> Home

Details and statistics

DOI: 10.1007/S001820100066

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijgt/ChuH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijgt/ChuH01
Francis C. Chu, Joseph Y. Halpern:
On the NP-completeness of finding an optimal strategy in games with common payoffs. Int. J. Game Theory 30(1): 99-106 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.