[GPS16] Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Authors: Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan | Venue: CRYPTO 2016 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{C:GarPanSri16,
  author = {Sanjam Garg and Omkant Pandey and Akshayaram Srinivasan},
  title = {Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium},
  pages = {579--604},
  editor = {Matthew Robshaw and Jonathan Katz},
  booktitle = {Advances in Cryptology -- {CRYPTO}~2016, Part~II},
  volume = {9815},
  series = {Lecture Notes in Computer Science},
  address = {Santa Barbara, CA, USA},
  month = {aug~14--18},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2016},
  doi = {10.1007/978-3-662-53008-5_20},
}