We derive exact optimal solutions for the problem of optimizing revenue in single-bidder multi-item auctions for uniform i.i.d. valuations. We give optimal auctions of up to 6 items; previous resultsâ€¦ (More)

a r t i c l e i n f o a b s t r a c t We study the classic frequent items problem in data streams, but from a competitive analysis point of view. We consider the standard worst-case input model, asâ€¦ (More)

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyerâ€™s values for the items come from independent (but not necessarily identical) distributions overâ€¦ (More)

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyerâ€™s valuations forâ€¦ (More)

We provide a new, much simplified and straightforward proof to a result of Pavlov [2011] regarding the revenue maximizing mechanism for selling two items with uniformly i.i.d. valuations overâ€¦ (More)

We study the problem of scheduling <i>m</i> tasks to <i>n</i> selfish, unrelated machines in order to minimize the makespan, in which the execution times are independent random variables, identicalâ€¦ (More)

In emerging pervasive scenarios, data is collected by sensing devices in streams that occur at several, distributed points of observation. The size of data typically far exceeds the storage andâ€¦ (More)

We introduce and study strongly truthful mechanisms and their applications. We use<lb>strongly truthful mechanisms as a tool for implementation in undominated strategies for sev-<lb>eral problems,â€¦ (More)