@InProceedings{chen_et_al:LIPIcs.ITCS.2017.57,
author = {Chen, Xi and Cheng, Yu and Tang, Bo},
title = {{Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {57:1--57:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.57},
URN = {urn:nbn:de:0030-drops-81636},
doi = {10.4230/LIPIcs.ITCS.2017.57},
annote = {Keywords: Equilibrium Computation, Query Complexity, Large Games}
}