@inproceedings{287c6e2a17b940b7b11d5213a3b610d1,
title = "On the Cryptographic Hardness of Finding a Nash Equilibrium",
abstract = "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. Previous proposals for basing PPAD-hardness on program obfuscation considered a strong 'virtual black-box' notion that is subject to severe limitations and is unlikely to be realizable for the programs in question. In contrast, for indistinguishability obfuscation no such limitations are known, and recently, several candidate constructions of indistinguishability obfuscation were suggested based on different hardness assumptions on multilinear maps. Our result provides further evidence of the intractability of finding a Nash equilibrium, one that is extrinsic to the evidence presented so far.",
keywords = "nash equilibrium, obfuscation",
author = "Nir Bitansky and Omer Paneth and Alon Rosen",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 ; Conference date: 17-10-2015 Through 20-10-2015",
year = "2015",
month = dec,
day = "11",
doi = "https://doi.org/10.1109/FOCS.2015.94",
language = "الإنجليزيّة",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "1480--1498",
booktitle = "Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015",
address = "الولايات المتّحدة",
}