Non-cooperative rational interactive proofs
From MaRDI portal
Recommendations
Cites work
- A course in game theory.
- Algebraic methods for interactive proof systems
- Competing provers protocols for circuit evaluation
- Efficient rational proofs for space bounded computations
- Efficient rational proofs with strong utility-gap guarantees
- Equilibrium Selection in Signaling Games
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1559566 (Why is no real title available?)
- scientific article; zbMATH DE number 2134909 (Why is no real title available?)
- Interactive proofs of proximity: delegating computation in sublinear time
- IP = PSPACE
- Justifiable Beliefs in Sequential Equilibrium
- Multi-oracle interactive protocols with constant space verifiers
- Non-deterministic exponential time has two-prover interactive protocols
- On games of incomplete information
- On the power of multi-prover interactive protocols
- Rational arguments: single round delegation with sublinear verification
- Rational proofs
- Rational proofs with multiple provers
- Rational sumchecks
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refereed delegation of computation
- Sequential Equilibria
- Sequentially composable rational proofs
- Signaling Games and Stable Equilibria
- Subgame perfect implementation of voting rules via randomized mechanisms
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- The complexity of two-person zero-sum games in extensive form
- The complexity of two-player games of incomplete information
- The knowledge complexity of interactive proof-systems
- Two protocols for delegation of computation
- Virtual implementation in backwards induction
Cited in
(5)
This page was built for publication: Non-cooperative rational interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075766)
