44 search results - page 2 / 9 » Learning and Approximating the Optimal Strategy to Commit To |
AAAI
2008
13 years 7 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
ICTAI
2009
IEEE
13 years 12 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
NIPS
2003
13 years 6 months ago
2003
We present a system to recognize phrases based on perceptrons, and a global online learning algorithm to train them together. The recognition strategy applies learning in two laye...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
ATMOS
2007
13 years 6 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...