Non-Cooperative Rational Interactive Proofs
暂无分享,去创建一个
[1] Joan Feigenbaum,et al. A game-theoretic classification of interactive complexity classes , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.
[2] Rosario Gennaro,et al. Sequentially Composable Rational Proofs , 2015, GameSec.
[3] D. Koller,et al. The complexity of two-person zero-sum games in extensive form , 1992 .
[4] Hannu Vartiainen,et al. Subgame perfect implementation of voting rules via randomized mechanisms , 2007, Soc. Choice Welf..
[5] H. J. Jacobsen,et al. The One-Shot-Deviation Principle for Sequential Rationality , 1996 .
[6] Motty Perry,et al. Virtual Implementation in Backwards Induction , 1996 .
[7] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[8] László Lovász,et al. Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.
[9] Tsuyoshi Ito,et al. A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[10] Benjamin Braun,et al. Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..
[11] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[12] Silvio Micali,et al. Rational proofs , 2012, STOC '12.
[13] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[14] Shikha Singh,et al. Rational Proofs with Multiple Provers , 2015, ITCS.
[15] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[16] Andrew J. Blumberg,et al. Verifying computations without reexecuting them , 2015, Commun. ACM.
[17] Nir Bitansky,et al. Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits , 2012, CRYPTO.
[18] Lance Fortnow,et al. On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..
[19] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[20] Hanspeter Pfister,et al. Verifiable Computation with Massively Parallel Interactive Proofs , 2012, HotCloud.
[21] Alon Rosen,et al. Rational Sumchecks , 2015, TCC.
[22] Ran Raz,et al. Competing provers protocols for circuit evaluation , 2013, ITCS '13.
[23] Pablo Azar,et al. Super-efficient rational proofs , 2013, EC '13.
[24] John C. Harsanyi,et al. Games with Incomplete Information , 1994 .
[25] D. Boneh,et al. Interactive proofs of proximity: delegating computation in sublinear time , 2013, STOC '13.
[26] U. Feige,et al. Making Games Short , 2006 .
[27] R. Beigel,et al. Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..
[28] Harry Buhrman,et al. Quantum bounded query complexity , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[29] A. McLennan. Justifiable Beliefs in Sequential Equilibrium , 1985 .
[30] Adi Shamir,et al. Multi-Oracle Interactive Protocols with Constant Space Verifiers , 1992, J. Comput. Syst. Sci..
[31] Madhu Sudan,et al. Probabilistically checkable proofs , 2009, CACM.
[32] Ran Canetti,et al. Refereed delegation of computation , 2013, Inf. Comput..
[33] Rosario Gennaro,et al. Efficient Rational Proofs for Space Bounded Computations , 2017, GameSec.
[34] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[35] David M. Kreps,et al. Signaling Games and Stable Equilibria , 1987 .
[36] Nicola Gatti,et al. New results on the verification of Nash refinements for extensive-form games , 2012, AAMAS.
[37] Alon Rosen,et al. Rational arguments: single round delegation with sublinear verification , 2014, ITCS.
[38] John Duggan. An extensive form solution to the adverse selection problem in principal/multi-agent environments , 1998 .
[39] John H. Reif,et al. The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..
[40] Yihua Zhang,et al. Efficient Secure and Verifiable Outsourcing of Matrix Multiplications , 2014, ISC.
[41] Shikha Singh,et al. Efficient Rational Proofs with Strong Utility-Gap Guarantees , 2018, SAGT.
[42] Kristoffer Arnsfelt Hansen,et al. The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements , 2010, SAGT.
[43] Ran Canetti,et al. Two 1-Round Protocols for Delegation of Computation , 2011, IACR Cryptol. ePrint Arch..
[44] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[45] J. Sobel,et al. Equilibrium Selection in Signaling Games , 1987 .
[46] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[47] Moshe Tennenholtz,et al. The Noisy Oracle Problem , 1988, CRYPTO.
[48] Andrew J. Blumberg,et al. Verifiable computation using multiple provers , 2014, IACR Cryptol. ePrint Arch..
[49] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[50] Ran Canetti,et al. Practical delegation of computation using multiple servers , 2011, CCS '11.
[51] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.