34 search results - page 2 / 7 » Online auctions and generalized secretary problems |
WINE
2010
Springer
13 years 3 months ago
2010
Springer
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
CRV
2009
IEEE
13 years 12 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
SODA
2007
ACM
13 years 6 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
SODA
2012
ACM
11 years 7 months 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...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...