Logarithmic query complexity for approximate Nash computation in large games

Paul W. Goldberg, Francisco J.Marmolejo Cossío, Zhiwei Steven Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Fingerprint

Dive into the research topics of 'Logarithmic query complexity for approximate Nash computation in large games'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science