327 citations · 563 across the 39 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.GT2011★ 5 cited
On Multiple Round Sponsored Search Auctions with Budgets
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi +1
In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be…
cs.GT2011
Multi-Unit Auction with Diminishing Marginal Valuations and Capacities
Riccardo Colini Baldeschi, Stefano Leonardi, Guido Schaefer
This paper has been withdrawn by the author.
cs.DS2011
Approximation Algorithms for Union and Intersection Covering Problems
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi +3
In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST…