Joan Feigenbaum, Daphne Koller, Peter Shor  Home/Search
Context Related
| rutgers.edu/pub/dimacs/Te...9521.ps.gz stanford.edu/~koller/pape...struct95.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: rutgers.edu/TechnicalRepor...1995 (more) From: stanford.edu/~koller/p...struct95 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Game-theoretic characterizations of complexity classes have often proved useful in understanding the power and limitations of these classes. One well-known example tells us that PSPACE can be characterized by two-person, perfect-information games in which the length of a played game is polynomial in the length of the description of the initial position [Chandra et al., Journal of the ACM, 28 (1981), pp. 114--133]. In this paper, we investigate the connection between game theory and interactive... (Update)
Context of citations to this paper: More
...the notions of perfect information and perfect recall. The few game theoretic notions that we use are defined precisely in, e.g. [9] 2 Alternation and Randomized Players Chandra et al. 5] proved a fundamental result about the connection between games and complexity...
Cited by: More
Making Games Short (Extended Abstract) - Feige, Kilian (Correct)
Games, Complexity Classes, and Approximation Algorithms - Feigenbaum (1998) (Correct)
Active bibliography (related documents): More All
1.8: A Game-Theoretic Classification of Interactive Complexity Classes - Extend Ed (Correct)
0.4: Decision Algorithms for Multiplayer Non-Cooperative Games.. - Peterson, Reif, Azhar (Correct)
0.3: Game Theory, Complexity And Simplicity II: Problems and.. - Shubik (1997) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Random Debaters and the Hardness of Approximating.. - Condon, Feigenbaum.. (1997) (Correct)
0.2: Probabilistically Checkable Debate Systems and.. - Condon, Feigenbaum.. (1995) (Correct)
0.2: From Statistics to Beliefs - Bacchus, Grove (1992) (Correct)
Related documents from co-citation: More All
2: Probabilistically checkable debate systems and approximation algorithms for PSPA.. - Condon, Feigenbaum et al. - 1993
2: Alternation (context) - Chandra, Kozen et al. - 1981
2: Random debaters and the hardness of approximating stochastic functions - Condon, Feigenbaum et al. - 1994
BibTeX entry: (Update)
J. Feigenbaum, D. Koller, and P. Shor, "A Game-Theoretic Classification of Interactive Complexity Classes," in Proceedings of the 10th Conference on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, 1995, pp. 227-237. http://citeseer.ist.psu.edu/feigenbaum95gametheoretic.html More
@inproceedings{ feigenbaum95gametheoretic,
author = "Joan Feigenbaum and Daphne Koller and Peter W. Shor",
title = "A Game-Theoretic Classification of Interactive Complexity Classes",
booktitle = "Structure in Complexity Theory Conference",
pages = "227-237",
year = "1995",
url = "citeseer.ist.psu.edu/feigenbaum95gametheoretic.html" }
Citations (may not include all citations):242 Nondeterministic Exponential Time has Two-Prover Interactive.. - Babai, Fortnow et al. - 1991
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
152 Probabilistic Computation: Towards a Unified Measure of Comp.. (context) - Yao - 1977
149 Fast Probabilistic Algorithms for Verification of Polynomial.. (context) - Schwartz - 1980
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1989
93 the Power of Multiprover Interactive Protocols - Fortnow, Rompel et al. - 1994
58 Games Against Nature (context) - Papadimitriou - 1985
50 Complete problems for deterministic polynomial time (context) - Jones, Laaser - 1974
43 Extensive games and the problem of information (context) - Kuhn - 1953
34 Alternation (context) - Chandra, Kozen et al. - 1981
25 Fast Algorithms for Finding Randomized Strategies in Game Tr.. - Koller, Meggido et al. - 1994
24 Eavesdropping Games: A GraphTheoretic Approach to Privacy in.. - Franklin, Galil et al. - 1993
24 On Complexity as Bounded Rationality (context) - Papadimitriou, Yannakakis - 1994
22 Locally Random Reductions in Interactive Complexity Theory - Feigenbaum - 1993
19 Linear Programming is LOG-SPACE Hard for P (context) - Dobkin, Lipton et al. - 1979
18 Uber eine Anwendung der Mengenlehre auf die Theorie des Scha.. (context) - Zermelo - 1913
17 The Complexity of Two-Player Games of Incomplete Information (context) - Reif - 1984
15 Handbook of Game Theory (context) - Aumann, Hart - 1992
14 Multiple Person Alternation (context) - Peterson, Reif - 1979
13 Consenting Agents: Negotiation Mechanisms for Multi-Agent Sy.. (context) - Rosenschein - 1993
12 IP = PSPACE (context) - Shamir - 1992
9 Probabilistic Game Automata (context) - Condon, Ladner - 1986
8 Universal Games of Incomplete Information (context) - Reif - 1979
7 Private vs. Common Random Bits in Communication Complexity - Newman - 1991
6 Alternation in Interaction - Kiwi, Lund et al. - 1994
3 ACM Distinguished Dissertation (context) - Condon, of - 1989
2 Collective Coin Flipping, Robust Voting Games, and Minima of.. (context) - Ben-Or, Linial - 1985
2 The Noisy Oracle Model (context) - Feige, Shamir et al. - 1990
Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/1995.html): More
Localizing a Robot with Minimum Travel - Dudek, Romanik, Whitesides (1995) (Correct)
On a Metric Generalization of Ramsey's Theorem - Erdös, Hajnal, Pach (1995) (Correct)
On the Approximability of Numerical Taxonomy.. - Agarwala, Bafna.. (1995) (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