Sciweavers

5 search results - page 1 / 1
» Fast convergence to Wardrop equilibria by adaptive sampling ...
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 4 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
UAI
2000
13 years 5 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
PODC
2005
ACM
13 years 10 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
ICML
2010
IEEE
13 years 2 months ago
Temporal Difference Bayesian Model Averaging: A Bayesian Perspective on Adapting Lambda
Temporal difference (TD) algorithms are attractive for reinforcement learning due to their ease-of-implementation and use of "bootstrapped" return estimates to make effi...
Carlton Downey, Scott Sanner
IVC
2007
142views more  IVC 2007»
13 years 4 months ago
Fast stochastic optimization for articulated structure tracking
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
Matthieu Bray, Esther Koller-Meier, Nicol N. Schra...