134 search results - page 4 / 27 » On the Complexity of Computing Values of Restricted Games |
AI
2006
Springer
13 years 7 months ago
2006
Springer
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
COCO
1991
Springer
13 years 11 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
DLOG
2001
13 years 9 months ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
AAAI
2012
11 years 10 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...