We consider repeated multi-unit auctions with uniform pricing, which are...
Our main result is designing an algorithm that returns a vertex cover of...
In the stochastic weighted matching problem, the goal is to find a
large...
In this paper, we study max-weight stochastic matchings on online bipart...
We study the minimum vertex cover problem in the following stochastic
se...
We study the problem of finding personalized reserve prices for unit-dem...
Let G=(V, E) be a given edge-weighted graph and let its realizationG be...
Suppose that we are given an arbitrary graph G=(V, E) and know that each...
We present the first algorithm for maintaining a maximal independent set...
We study the problem of computing revenue-optimal personalize
(non-anony...
The Colonel Blotto game, first introduced by Borel in 1921, is a well-st...
Dynamic programming is a powerful technique that is, unfortunately, ofte...
The success of massively parallel computation (MPC) paradigms such as
Ma...
Graph problems are troublesome when it comes to MapReduce. Typically, to...