: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...