Decision algorithms for multiplayer noncooperative games of incomplete information

DOI10.1016/S0898-1221(01)00282-6zbMath1011.91026OpenAlexW2073101761MaRDI QIDQ1609052

R. Smith

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00282-6

zbMATH Keywords

algorithmsgame theoryincomplete informationalternationblindfoldcomplexity theory

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Games in extensive form (91A18)

Related Items

Unnamed Item, Lower bounds for multiplayer noncooperative games of incomplete information, On Distributed Program Specification and Synthesis in Architectures with Cycles, Verification of multi-agent systems with public actions against strategy logic, The complexity of two-player games of incomplete information, Computation of equilibria in noncooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Solitaire automata
• Games against nature
• On the complexity of some two-person perfect-information games
• Handbook of game theory with economic applications. Vol. 1
• Relationships between nondeterministic and deterministic tape complexities
• N by N Checkers is Exptime Complete
• Nondeterministic Space is Closed under Complementation
• Provably Difficult Combinatorial Games
• GO Is Polynomial-Space Hard
• Alternation
• A Combinatorial Problem Which Is Complete in Polynomial Space
• The knowledge complexity of interactive proof-systems
• Computational Complexity and the Existence of Complexity Gaps
• Lower bounds for multiplayer noncooperative games of incomplete information