101 search results - page 11 / 21 » Approximation algorithms and online mechanisms for item pric... |
WINE
2010
Springer
14 years 7 months ago
2010
Springer
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Many advertisers (bidders) use Internet systems to buy advertisements on publishers' webpages or on traditional media such as radio, TV and newsprint. They seek a simple, onl...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
104
click to vote
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...