Parity Games with Partial Information Played on Graphs of Bounded Complexity.
Bernd PuchalaRoman RabinovichPublished in: MFCS (2010)
Keyphrases
- partial information
- incomplete information
- bounded treewidth
- polynomial time complexity
- nash equilibria
- game playing
- computational complexity
- game design
- autonomous agents
- constraint satisfaction
- decision problems
- computer games
- np complete
- graph matching
- graph mining
- graph theoretic
- search algorithm
- multi agent
- artificial intelligence