Sciweavers

1503 search results - page 34 / 301
» Generalized Parity Games
Sort
View
ICDCS
2010
IEEE
15 years 9 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ATAL
2009
Springer
16 years 12 days ago
Generalization risk minimization in empirical game models
Experimental analysis of agent strategies in multiagent systems presents a tradeoff between granularity and statistical confidence. Collecting a large amount of data about each s...
Patrick R. Jordan, Michael P. Wellman
IJCAI
2001
15 years 7 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ATAL
2006
Springer
15 years 9 months ago
On using multi-agent systems in playing board games
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
Stefan J. Johansson
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 6 months ago
Toward a general theory of quantum games
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...
Gus Gutoski, John Watrous