67 search results - page 2 / 14 » An Online Multi-unit Auction with Improved Competitive Ratio |
SIGECOM
2000
ACM
14 years 2 months ago
2000
ACM
This paper studies auctions in a setting where the di erent bidders arrive at di erent times and the auction mechanism is required to make decisions about each bid as it is receiv...
SODA
2012
ACM
12 years 7 days ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
SIGECOM
2005
ACM
14 years 3 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...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Online auction sites have very specific workloads and user behavior characteristics. Previous studies on workload characterization conducted by the authors showed that i) bidding a...