Delegation with Updatable Unambiguous Proofs and PPAD-Hardness

In this work, we construct an updatable and unambiguous delegation scheme based on the decisional assumption on bilinear groups introduced by Kalai, Paneth and Yang [STOC 2019]. Using this delegation scheme, we show PPAD-hardness (and hence the hardness of computing Nash equilibria) based on the qua...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखक: Yang, Lisa L.
अन्य लेखक: Vaikuntanathan, Vinod
स्वरूप: थीसिस
प्रकाशित: Massachusetts Institute of Technology 2022
ऑनलाइन पहुंच:https://hdl.handle.net/1721.1/140059