67 search results - page 1 / 14 » An Online Multi-unit Auction with Improved Competitive Ratio |
WINE
2009
Springer
13 years 11 months ago
2009
Springer
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
WINE
2010
Springer
13 years 2 months ago
2010
Springer
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...