Sciweavers

46 search results - page 6 / 10
» Discretization of Continuous Action Spaces in Extensive-Form...
Sort
View
101
Voted
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 4 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
70
Voted
AAAI
2000
14 years 11 months ago
Defining and Using Ideal Teammate and Opponent Agent Models
A common challenge for agents in multiagent systems is trying to predict what other agents are going to do in the future. Such knowledge can help an agent determine which of its c...
Peter Stone, Patrick Riley, Manuela M. Veloso
117
Voted
FORMATS
2010
Springer
14 years 8 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
ICDM
2009
IEEE
111views Data Mining» more  ICDM 2009»
15 years 5 months ago
A Game Theoretical Model for Adversarial Learning
Abstract—It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accura...
Wei Liu, Sanjay Chawla
111
Voted
AAMAS
2007
Springer
15 years 4 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé