Corpus ID: 15775790

Making Games Short

@inproceedings{Feige2006MakingGS,
  title={Making Games Short},
  author={U. Feige and Joe KilianyAbstractWe},
  year={2006}
}
  • U. Feige, Joe KilianyAbstractWe
  • Published 2006
  • We study the complexity of refereed games, in which two computationally unlimited players play against each other, and a polynomial time referee monitors the game and announces the winner. The players may exchange messages with the referee in private, resulting in a game of perfect recall but incomplete information. We show that any EXPTIME statement can be eeciently transformed into a refereed game in which if the statement is true, the rst player wins with overwhelming probability , and if… CONTINUE READING
    36 Citations
    Short Quantum Games
    • 1
    • PDF
    Upper bounds for quantum interactive proofs with competing provers
    • Gus Gutoski
    • Computer Science
    • 20th Annual IEEE Conference on Computational Complexity (CCC'05)
    • 2005
    • 13
    • Highly Influenced
    • PDF
    Parallel Approximation of Non-interactive Zero-sum Quantum Games
    • R. Jain, J. Watrous
    • Mathematics, Computer Science
    • 2009 24th Annual IEEE Conference on Computational Complexity
    • 2009
    • 33
    • PDF
    Entropy, Convex Optimization, and Competitive Quantum Interactions
    • Highly Influenced
    • PDF
    Non-Cooperative Rational Interactive Proofs
    • 1
    • PDF
    Complexity limitations on one-turn quantum refereed games
    • PDF
    Quantum Interactive Proofs with Competing Provers
    • 33
    • Highly Influenced
    • PDF
    Algorithms for Computing Solution Concepts in Game Theory
    • PDF
    The University of Calgary Short Quantum Games
    G T ] 1 5 A ug 2 01 9 Non-Cooperative Rational Interactive Proofs ∗
    • Highly Influenced

    References

    SHOWING 1-10 OF 43 REFERENCES
    The complexity of two-person zero-sum games in extensive form
    • 206
    • Highly Influential
    • PDF
    Simple strategies for large zero-sum games with applications to complexity theory
    • 85
    • Highly Influential
    • PDF
    The Complexity of Two-Player Games of Incomplete Information
    • J. Reif
    • Computer Science
    • J. Comput. Syst. Sci.
    • 1984
    • 303
    Fast algorithms for finding randomized strategies in game trees
    • 204
    • Highly Influential
    • PDF
    On the complexity of space bounded interactive proofs
    • 117
    • PDF
    Multi-Oracle Interactive Protocols with Constant Space Verifiers
    • 22
    • PDF
    Random debaters and the hardness of approximating stochastic functions
    • 63
    • PDF
    Alternation in interaction
    • 15
    • PDF
    The Noisy Oracle Problem
    • 34
    • PDF
    Multi-prover interactive proofs: how to remove intractability assumptions
    • 471
    • PDF