"Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium."

Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan (2016)

Details and statistics

DOI: 10.1007/978-3-662-53008-5_20

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics