758 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Microsoft (United States)US53 papers
- Cornell UniversityUS15 papers
- Carnegie Mellon UniversityUS9 papers
- University of Massachusetts AmherstUS8 papers
- Princeton UniversityUS7 papers
- Columbia UniversityUS6 papers
- Microsoft Research (United Kingdom)GB6 papers
- University of PennsylvaniaUS6 papers
- University of Maryland, College ParkUS5 papers
- University of MichiganUS5 papers
- Harvard UniversityUS4 papers
- Stanford UniversityUS4 papers
4 papers · 1 filter
Adversarial Bandits with Knapsacks
Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire +1
We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a we…
Public Transit Labeling
Daniel Delling, Julian Dibbelt, Thomas Pajor +1
We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approac…
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
Chien-Ju Ho, Aleksandrs Slivkins, Jennifer Wortman Vaughan
Crowdsourcing markets have emerged as a popular platform for matching available workers with tasks to complete. The payment for a particular task is typically set by the task's req…
Contextual Bandits with Similarity Information
Aleksandrs Slivkins
In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence of choices. In each round it chooses from a time-invariant set of alternatives and receives the payoff a…