Contextual bandits with similarity information

Authors: Aleksandrs Slivkins

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://arxiv.org/pdf/0907.3986v1.pdf.

Subject Terms: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation General Terms, Algorithms, Theory. Keywords, online learning, multi-armed bandits, contextual bandits, regret minimization, metric spaces

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.2364; http://arxiv.org/pdf/0907.3986v1.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.2364
http://arxiv.org/pdf/0907.3986v1.pdf

Approximation in Stochastic Scheduling: The Power of LP-based Priority Policies

Authors: Rolf H. Möhring, Andreas S. Schulz, Marc Uetz

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.math.tu-berlin.de/~uetz/jacm-subm.ps.Z.

Subject Terms: by Abstract Devices, Modes of Computation---Online computation General Terms, ALGORITHMS, THEORY Additional Key Words and Phrases, Stochastic scheduling, Approximation, Worst-case performance, Priority policy, LP-relaxation, WSEPT rule, Asymptotic optimality

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4164

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.4164
http://www.math.tu-berlin.de/~uetz/jacm-subm.ps.Z