On games of incomplete information

DOI10.1016/0304-3975(92)90085-TzbMath0757.90090OpenAlexW2019750722MaRDI QIDQ1199525

Anne Condon, Richard J. Lipton, Jin-Yi Cai

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90085-t

zbMATH Keywords

cooperationfree gamemulti-prover interactive proof systems

Mathematics Subject Classification ID

Cooperative games (91A12) 2-person games (91A05)

Related Items (6)

On the power of multi-prover interactive protocols ⋮ Towards the parallel repetition conjecture ⋮ Parallel Repetition of Two-Prover One-Round Games: An Exposition ⋮ Unnamed Item ⋮ REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM ⋮ PSPACE is provable by two provers in one round

Cites Work

• PSPACE is provable by two provers in one round
• Fully parallelized multi-prover protocols for NEXP-time
• The knowledge complexity of interactive proof-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On games of incomplete information