Sciweavers

18 search results - page 1 / 4
» Envy-free auctions for digital goods
Sort
View
SIGECOM
2003
ACM
106views ECommerce» more  SIGECOM 2003»
13 years 9 months ago
Envy-free auctions for digital goods
We study auctions for a commodity in unlimited supply, e.g., a digital good. In particular we consider three desirable properties for auctions: • Competitive: the auction achiev...
Andrew V. Goldberg, Jason D. Hartline
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
13 years 10 months ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...
SODA
2001
ACM
109views Algorithms» more  SODA 2001»
13 years 5 months ago
Competitive auctions and digital goods
Andrew V. Goldberg, Jason D. Hartline, Andrew Wrig...
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 5 months ago
Online learning in online auctions
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...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
WINE
2010
Springer
168views Economy» more  WINE 2010»
13 years 2 months ago
On the Competitive Ratio of Online Sampling Auctions
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...
Elias Koutsoupias, George Pierrakos