The computational complexity of Nash equilibria in concisely represented games. Schoenebeck, G. & Vadhan, S. ACM Transactions on the Theory of Computation, 2012. To Appear
bibtex   
@article{SchoenebeckV12,
 author = {Grant Schoenebeck and Salil Vadhan},
 title = {The computational complexity of {N}ash equilibria in concisely represented games},
 journal = {ACM Transactions on the Theory of Computation},
 year = {2012},
 volume = {4},
 issue = {1},
 NOTE = "To Appear",
}

Downloads: 0