The approximation complexity of win-lose games

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The approximation complexity of win-lose games

Source

Symposium on Discrete Algorithms archive
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

New Orleans, Louisiana

Pages: 159 - 168

Year of Publication: 2007

ISBN:978-0-898716-24-5

Authors

Sponsors

: SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 3

Additional Information:

cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 3

	Constantinos Daskalakis , Grant Schoenebeck , Gregory Valiant , Paul Valiant, On the complexity of Nash equilibria of action-graph games, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.710-719, January 04-06, 2009, New York, New York
	Christian Borgs , Jennifer Chayes , Nicole Immorlica , Adam Tauman Kalai , Vahab Mirrokni , Christos Papadimitriou, The myth of the folk theorem, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Xi Chen , Xiaotie Deng , Shang-Hua Teng, Settling the complexity of computing two-player Nash equilibria, Journal of the ACM (JACM), v.56 n.3, p.1-57, May 2009

Xi Chen: colleagues

Shang-Hua Teng: colleagues

Paul Valiant: colleagues