"Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)."

Panagiota N. Panagopoulou, Paul G. Spirakis (2014)

> Home

Details and statistics

DOI: 10.1007/S00224-013-9446-3

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/PanagopoulouS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/PanagopoulouS14
Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Theory Comput. Syst. 54(3): 479-490 (2014)

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.