Decision algorithms for multiplayer noncooperative games of incomplete information

DOI10.1016/S0898-1221(01)00282-6MaRDI QIDQ1609052zbMATH OpenOpenAlexFDO

Authors 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 theorycomplexity theoryincomplete informationalternationblindfold

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds for multiplayer noncooperative games of incomplete information
• Cooperative games with incomplete information: some open problems
• Toward the Theory of Cooperative Games under Incomplete Information
• scientific article; zbMATH DE number 739686
• scientific article; zbMATH DE number 509216
• scientific article; zbMATH DE number 5954369
• Cooperative games with incomplete information
• scientific article; zbMATH DE number 176277
• scientific article; zbMATH DE number 2204540
• Computation of equilibria in noncooperative games

Cites work

• scientific article; zbMATH DE number 3723925 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• N by N Checkers is Exptime Complete
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Alternation
• Computational Complexity and the Existence of Complexity Gaps
• GO Is Polynomial-Space Hard
• Games against nature
• Handbook of game theory with economic applications. Vol. 1
• Lower bounds for multiplayer noncooperative games of incomplete information
• Nondeterministic Space is Closed under Complementation
• On the complexity of some two-person perfect-information games
• Provably Difficult Combinatorial Games
• Relationships between nondeterministic and deterministic tape complexities
• Solitaire automata
• The complexity of two-player games of incomplete information
• The knowledge complexity of interactive proof-systems

Cited in

(9)

• The complexity of two-player games of incomplete information
• Lower bounds for multiplayer noncooperative games of incomplete information
• A backward-traversal-based approach for symbolic model checking of uniform strategies for constrained reachability
• NONCOOPERATIVE GAMES FROM TU GAMES WITH INFORMATION COST
• Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information
• Verification of multi-agent systems with public actions against strategy logic
• On Distributed Program Specification and Synthesis in Architectures with Cycles
• scientific article; zbMATH DE number 3956860 (Why is no real title available?)
• Computation of equilibria in noncooperative games

This page was built for publication: Decision algorithms for multiplayer noncooperative games of incomplete information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609052)