Query complexity of approximate nash equilibria

Yakov Babichenko. Query complexity of approximate nash equilibria. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pages 535-544, ACM, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.