Playing games of incomplete information

  • Jin-yi Cai
  • Anne Condon
  • Richard J. Lipton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 415)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Babai, Trading Group Theory for Randomness, Proceedings of 17th STOC, 1985, pp 421–429.Google Scholar
  2. [2]
    M. Ben-Or, S. Goldwasser, J. Killian and A. Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability, Proceedings of the 20th STOC, May, 1988.Google Scholar
  3. [3]
    B. Bollobás, Extremal Gaph Theory, Academic Press, 1978.Google Scholar
  4. [4]
    L. Fortnow, Complexity-Theoretic Aspects of Interactive Proof Systems, Ph. D. Thesis, Tech Report #MIT/LCS/TR-447, MIT.Google Scholar
  5. [5]
    L. Fortnow, J. Rompel and M. Sipser, On the Power of Multi-Prover Interactive Protocols, Proceedings of the conference on Structure in Complexity Theory, 1988, pp 156–161.Google Scholar
  6. [6]
    S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive protocols, Proceedings of 17th STOC, 1985, pp 291–304.Google Scholar
  7. [7]
    S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof Systems, Proceedings of 18th STOC, 1986, pp 59–68.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Jin-yi Cai
    • 1
  • Anne Condon
    • 2
  • Richard J. Lipton
    • 3
  1. 1.Department of Computer SciencePrinceton UniversityPrinceton
  2. 2.Computer Science DepartmentUniversity of Wisconsin-MadisonUSA
  3. 3.Department of Computer SciencePrinceton UniversityPrinceton

Personalised recommendations