128 search results - page 13 / 26 » Representation and Complexity in Boolean Games |
CORR
1998
Springer
13 years 9 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
AI
2001
Springer
14 years 2 months ago
2001
Springer
The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...