309 citations · 1.1k across the 60 of their papers we have counts for
6 papers · 2 filters
Bandits and Experts in Metric Spaces
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the…
A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting
Rad Niazadeh, Robert D. Kleinberg
We present a unified framework for designing and analyzing algorithms for online budgeted allocation problems (including online matching) and their generalization, the Online Gener…
Trace Complexity of Network Inference
Bruno Abrahao, Flavio Chierichetti, Robert Kleinberg +1
The network inference problem consists of reconstructing the edge set of a network given traces representing the chronology of infection times as epidemics spread through the netwo…
Polymatroid Prophet Inequalities
Paul Duetting, Robert Kleinberg
Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence a…
Prophet Inequalities with Limited Information
Pablo D. Azar, Robert Kleinberg, S. Matthew Weinberg
In the classical prophet inequality, a gambler observes a sequence of stochastic rewards and must decide, for each reward , whether to keep it and stop the game…
Bandits with Knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins
Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trial…