Sciweavers

3780 search results - page 68 / 756
» Algorithms for Game Metrics
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
ATAL
2009
Springer
14 years 4 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
JSAC
2006
135views more  JSAC 2006»
13 years 10 months ago
Route-Metric-Based Dynamic Routing and Wavelength Assignment for Multifiber WDM Networks
We present three dynamic routing and wavelength assignment (RWA) algorithms that are intended for multifiber WDM networks without wavelength converters. For networks with a large n...
Jong-Seon Kim, D. C. Lee, H. Sridhar
FOCS
2008
IEEE
14 years 4 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...