#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2002

2018

- This year (3)
- Last 5 years (15)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Varsha Dani, Thomas P. Hayes, Sham M. Kakade
- COLT
- 2008

In the classical stochastic k-armed bandit problem, in each of a sequence of rounds, a decision maker chooses one of k arms and incurs a cost chosen from an unknown distribution associated with thatâ€¦ (More)

- Ivona BezÃ¡kovÃ¡, Varsha Dani
- SIGecom Exchanges
- 2005

The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. the cake-cutting problem) and economics (e.g. market equilibria). On the other hand, the naturalâ€¦ (More)

- Varsha Dani, Thomas P. Hayes, Sham M. Kakade
- NIPS
- 2007

In the online linear optimization problem, a learner must choose, in each round, a decision from a set D âŠ‚ R in order to minimize an (unknown and changing) linear cost function. We present sharpâ€¦ (More)

- Varsha Dani, Thomas P. Hayes
- SODA
- 2006

We consider "online bandit geometric optimization," a problem of iterated decision making in a largely unknown and constantly changing environment. The goal is to minimize "regret," defined as theâ€¦ (More)

We introduce a reduction-based model for analyzing supervised learning tasks. We use this model to devise a new reduction from multi-class cost-sensitive classification to binary classification withâ€¦ (More)

We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most Oâˆ—( âˆš T ) against anâ€¦ (More)

- Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia
- PODC
- 2012

We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous message passing communication model, but we do not assume the existence of a broadcast channel. Ourâ€¦ (More)

The Max-Min Fairness problem is as follows: Given m indivisible goods and k players, each with a specified valuation function on the subsets of the goods, how should the goods be split between theâ€¦ (More)

Predicting the outcomes of future events is a challenging problem for which a variety of solution methods have been explored and attempted. We present an empirical comparison of a variety of onlineâ€¦ (More)

- Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia
- ICDCN
- 2014

We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For anyâ€¦ (More)