Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
Well−Supported versus Approximate Nash Equilibria: Query Complexity of Large Games
Well−Supported versus Approximate Nash Equilibria: Query Complexity of Large Games
Xi Chen‚ Xi Chen‚ Yu Cheng and Bo Tang
Book Title
Proceedings of the 2017 ACM Conference on Innovations in Theoretical Computer Science
Series
ITCS'17
Year
2017
Links
BibTeX
See Also
Bo Tang
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top