67 search results - page 5 / 14 » An Online Multi-unit Auction with Improved Competitive Ratio |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
ICPP
1998
IEEE
14 years 25 days ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
WINE
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
CSO
2009
IEEE
14 years 3 months ago
2009
IEEE
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
SIAMCOMP
2012
11 years 11 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...