34 search results - page 4 / 7 » Online auctions and generalized secretary problems |
102
click to vote
ATAL
2006
Springer
14 years 11 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
73
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
79
Voted
KDD
2005
ACM
15 years 3 months ago
2005
ACM
Online auctions are generating a new class of fine-grained data about online transactions. This data lends itself to a variety of applications and services that can be provided to...
80
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...