The Complexity of Computing a Nash Equilibrium
The Complexity of Computing a Nash Equilibrium
About this item
Full title
Author / Creator
Publisher
Philadelphia: Society for Industrial and Applied Mathematics
Journal title
Language
English
Formats
Publication information
Publisher
Philadelphia: Society for Industrial and Applied Mathematics
Subjects
More information
Scope and Contents
Contents
In 1951, John F. Nash proved that every game has a Nash equilibrium. Many algorithms have since been proposed for finding Nash equilibria, but none known to run in polynomial time. In 1991 the complexity class PPAD (polynomial parity arguments on directed graphs), for which Brouwer's problem is complete, was introduced, motivated largely by the cla...
Alternative Titles
Full title
The Complexity of Computing a Nash Equilibrium
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_907965331
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_907965331
Other Identifiers
ISSN
0097-5397
E-ISSN
1095-7111
DOI
10.1137/070699652
