48 search results - page 8 / 10 » Seller-Focused Algorithms for Online Auctioning |
161
click to vote
SIGECOM
2009
ACM
16 years 13 days 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...
143
click to vote
SIGECOM
2006
ACM
15 years 12 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
180
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
165
click to vote
EUROSYS
2007
ACM
15 years 9 months ago
2007
ACM
Recent research has found that operators frequently misconfigure Internet services, causing various availability and performance problems. In this paper, we propose a software inf...
244
click to vote
APPROX
2007
Springer
16 years 3 days ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...