Sciweavers

441 search results - page 77 / 89
» Convergence of Non-Elitist Strategies
Sort
View
NIPS
2003
13 years 8 months ago
Extending Q-Learning to General Adaptive Multi-Agent Systems
Recent multi-agent extensions of Q-Learning require knowledge of other agents’ payoffs and Q-functions, and assume game-theoretic play at all times by all other agents. This pap...
Gerald Tesauro
CCGRID
2009
IEEE
13 years 8 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
CN
2006
93views more  CN 2006»
13 years 7 months ago
Revisiting unfairness in Web server scheduling
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Ti...
Mingwei Gong, Carey L. Williamson
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 7 months ago
Cognitive Medium Access: Exploration, Exploitation and Competition
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...
Lifeng Lai, Hesham El Gamal, Hai Jiang, H. Vincent...
MOR
2006
80views more  MOR 2006»
13 years 7 months ago
Regret Minimization Under Partial Monitoring
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...