Sciweavers

1523 search results - page 1 / 305
» Partially ordered secretaries
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 3 months ago
Partially ordered secretaries
Ragnar Freij, Johan Wästlund
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
13 years 11 months ago
A Knapsack Secretary Problem with Applications
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...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 7 months ago
Improved competitive ratio for the matroid secretary problem
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...
Sourav Chakraborty, Oded Lachish
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 6 months ago
Matroids, secretary problems, and online mechanisms
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...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
12 years 4 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák