• Publications
  • Influence
Geographic Routing Using Hyperbolic Space
TLDR
We propose a scalable and reliable point-to-point routing algorithm for ad hoc wireless networks and sensor-nets. Expand
Learning diverse rankings with multi-armed bandits
TLDR
We present two online learning algorithms that directly learn a diverse ranking of documents based on users' clicking behavior. Expand
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
TLDR
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of trials so as to minimize the total cost of the chosen strategies. Expand
Multi-armed bandits in metric spaces
TLDR
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of $n$ trials so as to maximize the total payoff of the chosen strategies. Expand
The value of knowing a demand curve: bounds on regret for online posted-price auctions
TLDR
We consider price-setting algorithms for a simple market in which a seller has an unlimited supply of identical copies of some good, and interacts sequentially with a pool of n buyers, each of whom wants at most one copy of the good. Expand
The K-armed Dueling Bandits Problem
TLDR
We study a partial information online-learning problem where actions are restricted to noisy comparisons between pairs of strategies (also known as bandits). Expand
Bandits with Knapsacks
TLDR
We present two algorithms whose reward is close to the information-theoretic optimum: one is based on a novel "balanced exploration" paradigm and the other is a primal-dual algorithm that uses multiplicative updates. Expand
Merlin: A Language for Provisioning Network Resources
TLDR
This paper presents Merlin, a new framework for managing resources in software-defined networks. Expand
Algorithmic pricing via virtual valuations
TLDR
Algorithmic pricing is the computational problem that sellers (e.g., supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a known demand. Expand
Matroids, secretary problems, and online mechanisms
TLDR
We study a generalization of the classical secretary problem which we call the "matroid secretary problem". Expand
...
1
2
3
4
5
...