147 search results - page 24 / 30 » Logarithmic keying |
TCS
2010
13 years 8 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...