On the Cryptographic Hardness of Finding a Nash Equilibrium

Nir Bitansky, Omer Paneth, Alon Rosen. On the Cryptographic Hardness of Finding a Nash Equilibrium. Electronic Colloquium on Computational Complexity (ECCC), 22:1, 2015. [doi]

Abstract

Abstract is missing.