Sciweavers

800 search results - page 83 / 160
» On the Complexity of Parity Games
Sort
View
JMLR
2010
99views more  JMLR 2010»
13 years 4 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
ATAL
2008
Springer
13 years 11 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
DIMACS
1996
13 years 10 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ICPR
2006
IEEE
14 years 10 months ago
Bayesian Imitation of Human Behavior in Interactive Computer Games
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...
Bernard Gorman, Christian Bauckhage, Christian Thu...
CHI
2004
ACM
14 years 9 months ago
Social interaction in 'there'
Persistent online environments, such as multi-player games, exhibit a complex social organisation. These environments often feature large social groupings and elaborate cooperativ...
Barry Brown, Marek Bell