"An algorithm for finding approximate Nash equilibria in bimatrix games."

Lunshan Gao (2021)

> Home

Details and statistics

DOI: 10.1007/S00500-020-05213-Y

access: closed

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/Gao21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/Gao21
Lunshan Gao:
An algorithm for finding approximate Nash equilibria in bimatrix games. Soft Comput. 25(2): 1181-1191 (2021)

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.