The complexity of pure Nash equilibria Export

@inproceedings{citeulike:1417149, address = {New York, NY, USA}, author = {Fabrikant, Alex and Papadimitriou, Christos and Talwar, Kunal}, booktitle = {STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing}, citeulike-article-id = {1417149}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1007352.1007445}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1007352.1007445}, doi = {10.1145/1007352.1007445}, isbn = {1581138520}, keywords = {congestion, games, pls}, pages = {604--612}, posted-at = {2008-04-22 10:55:29}, priority = {3}, publisher = {ACM Press}, title = {The complexity of pure Nash equilibria}, url = {http://dx.doi.org/10.1145/1007352.1007445}, year = {2004} }

TY - CONF ID - citeulike:1417149 L3 - citeulike-article-id:1417149 SN - 1581138520 AD - New York, NY, USA EP - 612 TI - The complexity of pure Nash equilibria PB - ACM Press T2 - STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing SP - 604 KW - congestion KW - games KW - pls AU - Fabrikant, Alex AU - Papadimitriou, Christos AU - Talwar, Kunal PY - 2004/// UR - http://dx.doi.org/10.1145/1007352.1007445 ER -