On the Cryptographic Hardness of Finding a Nash Equilibrium


We prove that finding a Nash equilibrium of a game is hard, assuming the existence of indistinguishability obfuscation and one-way functions with sub-exponential hardness. We do so by showing how these cryptographic primitives give rise to a hard computational problem that lies in the complexity class PPAD, for which finding Nash equilibrium is complete… (More)
DOI: 10.1109/FOCS.2015.94



Citations per Year

Citation Velocity: 14

Averaging 14 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Bitansky2014OnTC, title={On the Cryptographic Hardness of Finding a Nash Equilibrium}, author={Nir Bitansky and Omer Paneth and Alon Rosen}, journal={2015 IEEE 56th Annual Symposium on Foundations of Computer Science}, year={2014}, pages={1480-1498} }