"A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms ..."

Endre Boros et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-79709-8_13

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/BorosEGMO08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/BorosEGMO08
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109

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.