Complexity of decision problems based on finite two-person perfect-information games
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A combinatorial problem which is complete in polynomial space
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Distributed pursuit-evasion: some aspects of privacy and security in distributed computing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the analysis of cooperation and antagonism in networks of communicating processes
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A dynamic logic of multiprocessing with incomplete information
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The logic of distributed protocols: preliminary report
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking on trees with path equivalences
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
On distributed program specification and synthesis in architectures with cycles
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Equivalence of games with probabilistic uncertainty and partial-observation games
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A survey of partial-observation stochastic parity games
Formal Methods in System Design
| Hi-index | 0.00 |
We consider two-person games of incomplete information in which certain portions of positions are private to each player and cannot be viewed by the opponent. We present various games of incomplete information which are universal for all reasonable games. The problem of determining the outcome of these universal games from a given initial position is shown to be complete in doubly-exponential time. We also define “private alternating Turing machines” which are alternating Turing machines with certain tapes and portions of states private to universal states. The time and space complexity of these machines is characterized in terms of the time complexity of deterministic Turing machines, with single and double exponential jumps. We also consider blindfold games, which are restricted games in which the second player is not allowed to modify the common position. We show various blindfold games to have exponential space complete outcome problems and to be universal for reasonable blindfold games. We define “blind alternating Turing machines” which are private alternating Turing machines with the restriction that the universal states cannot modify the public tapes and public portion of states. A single exponential jump characterizes the relation between the space complexity of deterministic Turing machines.