56 search results - page 8 / 12 » Maximizing Revenue in Sequential Auctions |
137
click to vote
WINE
2009
Springer
15 years 10 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, ...
116
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
130
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
130
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
119
click to vote
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
E-commerce, and online auctions in particular, represent important examples of how information and communication technologies have been employed by public organizations to gain be...