A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
In visual 3-D reconstruction tasks with mobile cameras, one wishes to move the cameras so that they provide the views that lead to the best reconstruction result. When the camera ...
Stefan Wenhardt, Benjamin Deutsch, Elli Angelopoul...
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
—Link quality estimation has been an active area of research within the wireless sensor network community. It is now well known that the estimation of reliable links requires few...
Marco Zuniga, Izabela Irzynska, Jan-Hinrich Hauer,...