60 search results - page 1 / 12 » From optimal limited to unlimited supply auctions |
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
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...
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
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...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...