Improved Algorithms and Analysis for Secretary Problems and Generalizations
SIAM Journal on Discrete Mathematics
The Dynamic and Stochastic Knapsack Problem
Operations Research
Adaptive limited-supply online auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
ACM SIGACT News
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The hiring problem and Lake Wobegon strategies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Competitive Analysis of Aggregate Max in Windowed Streaming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Automated online mechanism design and prophet inequalities
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Optimal algorithms for k-search with application in option pricing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Incentives in online auctions via linear programming
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Selective call out and real time bidding
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The Hiring Problem and Lake Wobegon Strategies
SIAM Journal on Computing
Secretary problems and incentives via linear programming
ACM SIGecom Exchanges
Hiring a secretary from a poset
Proceedings of the 12th ACM conference on Electronic commerce
Buyback problem: approximate matroid intersection with cancellation costs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved competitive ratios for submodular secretary problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved competitive ratio for the matroid secretary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Matroid secretary problem in the random assignment model
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems via linear programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Learning on a budget: posted price mechanisms for online procurement
Proceedings of the 13th ACM Conference on Electronic Commerce
Interviewing secretaries in parallel
Proceedings of the 13th ACM Conference on Electronic Commerce
Mechanism design for dynamic environments: online double auctions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Model Predictive Control for Dynamic Resource Allocation
Mathematics of Operations Research
Secretary problems with convex costs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online mechanism design (randomized rounding on the fly)
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Advances on matroid secretary problems: free order model and laminar case
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Recent advances on the matroid secretary problem
ACM SIGACT News
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In the classical secretary problem, a set S of numbers is presented to an online algorithm in random order. At any time the algorithm may stop and choose the current element, and the goal is to maximize the probability of choosing the largest element in the set. We study a variation in which the algorithm is allowed to choose k elements, and the goal is to maximize their sum. We present an algorithm whose competitive ratio is 1-O(√1/k). To our knowledge, this is the first algorithm whose competitive ratio approaches 1 as k ← ∞. As an application we solve an open problem in the theory of online auction mechanisms.