Uriel Feige, Joe Kilian  Home/Search
Context
Related
| wisdom.weizmann.ac.il/~feige...games.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac....otherpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 efficiently transformed into a refereed game in which if the statement is true, the first player wins with overwhelming probability, and if ... (Update)
Active bibliography (related documents): More All
0.6: Games, Complexity Classes, and Approximation Algorithms - Feigenbaum (1998) (Correct)
0.3: A Game-Theoretic Classification of Interactive Complexity.. - Feigenbaum, Koller, Shor (1995) (Correct)
0.3: Alternation in Interaction - Kiwi, Lund, Russell, Spielman.. (1994) (Correct)
Similar documents based on text: More All
0.3: Zero Knowledge and the Chromatic Number - Feige, Kilian (1996) (Correct)
0.3: The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994) (Correct)
0.2: On Limited versus Polynomial Nondeterminism - Feige (1997) (Correct)
BibTeX entry: (Update)
@misc{ feige-making,
author = "Uriel Feige and Joe Kilian",
title = "Making Games Short (Extended Abstract)",
url = "citeseer.ist.psu.edu/677869.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1989
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
182 The theory of games and economic behavior (context) - von Neumann, Morgenstern - 1947
172 Algebraic Methods for Interactive Proof Systems - Lund, Fortnow et al. - 1992
132 Relationship between nondeterministic and deterministic tape.. (context) - Savitch - 1970
79 Arthur-Merlin games: a randomized proof system, and a hierar.. (context) - Babai, Moran - 1988
65 Journal of the ACM (context) - Shamir, PSPACE - 1992
43 Extensive games and the problem of information (context) - Kuhn - 1953
43 A parallel approximation algorithm for positive linear progr.. - Luby, Nisan - 1993
34 Alternation (context) - Chandra, Kozen et al. - 1981
26 the complexity of space bounded interactive proofs (context) - Condon, Lipton - 1989
25 Fast algorithms for finding randomized strategies in game tr.. - Koller, Megiddo et al. - 1994
24 Probabilistically checkable debate systems and nonapproximab.. - Condon, Feigenbaum et al. - 1995
24 The complexity of twoperson zero-sum games in extensive form - Koller, Megiddo - 1992
19 Random debaters and the hardness of approximating stochastic.. - Condon, Feigenbaum et al. - 1994
18 Uber eine Anwendung der Mengenlehre auf die Theorie des Scha.. (context) - Zermelo - 1913
18 Approximating linear programming is log-space complete for P (context) - Serna - 1991
17 The complexity of two-player games of incomplete information (context) - Reif - 1984
17 Multi-prover interactive proofs: How to remove intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
11 On approximation algorithms for #P (context) - Stockmeyer - 1985
9 Simple strategies for large zero-sum games with applications.. - Lipton, Young - 1994
6 The noisy oracle problem (context) - Feige, Shamir et al. - 1990
6 Alternation in Interaction - Kiwi, Lund et al. - 1994
6 A note on approximate linear programming - Megiddo - 1992
5 Symmetric alternation captures BPP - Russell, Sundaram
2 A gametheoretic classification of interactive complexity cla.. - Feigenbaum, Koller et al. - 1995
1 Multi-Oracle Interactive Protocols with Constant Space Verif.. (context) - Feige, Shamir - 1992
Documents on the same site (http://www.wisdom.weizmann.ac.il/~feige/otherpapers.html): More
On the Sum of Nonnegative Independent - Random Variables With (Correct)
On The Hardness Of Computing - The Permanent Of (Correct)
Sampling Vertex Degrees and Estimating Network Load Parameters - Feige (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC