scientific article; zbMATH DE number 7525466

DOI10.4230/LIPIcs.ESA.2019.29MaRDI QIDQ5075766

Shikha Singh, Jing Chen, Samuel McCauley

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1708.00521

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interactive proofsnon-cooperative game theoryextensive-form games with imperfect informationrational proofsrefined sequential equilibrium

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Structural complexity of rational interactive proofs, Verifiable crowd computing: coping with bounded rationality

Uses Software

• Quin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refereed delegation of computation
• Non-deterministic exponential time has two-prover interactive protocols
• The complexity of two-player games of incomplete information
• Multi-oracle interactive protocols with constant space verifiers
• The complexity of two-person zero-sum games in extensive form
• On games of incomplete information
• Reexamination of the perfectness concept for equilibrium points in extensive games
• On the power of multi-prover interactive protocols
• Efficient rational proofs with strong utility-gap guarantees
• Efficient rational proofs for space bounded computations
• Virtual implementation in backwards induction
• Subgame perfect implementation of voting rules via randomized mechanisms
• Rational Sumchecks
• Rational Proofs with Multiple Provers
• Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
• Competing provers protocols for circuit evaluation
• Rational arguments
• Signaling Games and Stable Equilibria
• Sequentially Composable Rational Proofs
• Justifiable Beliefs in Sequential Equilibrium
• Equilibrium Selection in Signaling Games
• Sequential Equilibria
• Algebraic methods for interactive proof systems
• IP = PSPACE
• The knowledge complexity of interactive proof-systems
• Two Protocols for Delegation of Computation
• Rational proofs
• Interactive proofs of proximity