800 search results - page 28 / 160 » On the Complexity of Parity Games |
COCO
2005
Springer
15 years 4 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
NIPS
2007
15 years 20 days ago
2007
It is known that determinining whether a DEC-POMDP, namely, a cooperative partially observable stochastic game (POSG), has a cooperative strategy with positive expected reward is ...
AI
2004
Springer
14 years 11 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
DAM
2008
14 years 11 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
HICSS
2007
IEEE
15 years 5 months ago
2007
IEEE
We examine learning culture in a popular online game, World of Warcraft. We analyze the way players learn this complex game through chat conversation with peers. We describe three...