Decision algorithms for multiplayer noncooperative games of incomplete information
From MaRDI portal
Publication:1609052
DOI10.1016/S0898-1221(01)00282-6zbMATH Open1011.91026OpenAlexW2073101761MaRDI QIDQ1609052FDOQ1609052
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
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
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Nondeterministic Space is Closed under Complementation
- Alternation
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- The complexity of two-player games of incomplete information
- Provably Difficult Combinatorial Games
- Title not available (Why is that?)
- Lower bounds for multiplayer noncooperative games of incomplete information
- Title not available (Why is that?)
- Computational Complexity and the Existence of Complexity Gaps
- On the complexity of some two-person perfect-information games
- GO Is Polynomial-Space Hard
- A Combinatorial Problem Which Is Complete in Polynomial Space
- N by N Checkers is Exptime Complete
- Games against nature
- Handbook of game theory with economic applications. Vol. 1
- Solitaire automata
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- 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)
