1176 search results - page 48 / 236 » Exploiting Online Games |
118
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
138
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Online learning algorithms have impressive convergence properties when it comes to risk minimization and convex games on very large problems. However, they are inherently sequenti...
154
Voted
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
127
click to vote
ALT
2008
Springer
16 years 16 days ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
122
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...