Sum-of-squares meets nash: lower bounds for finding any equilibrium

Pravesh K. Kothari, Ruta Mehta. Sum-of-squares meets nash: lower bounds for finding any equilibrium. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 1241-1248, ACM, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.