Randomized algorithms
Stochastic on-line knapsack problems
Mathematical Programming: Series A and B
Average-case analysis of off-line and on-line knapsack problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Dynamics of bid optimization in online advertisement auctions
Proceedings of the 16th international conference on World Wide Web
Budget optimization in search-based advertising auctions
Proceedings of the 8th ACM conference on Electronic commerce
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Budget constrained bidding in keyword auctions and online knapsack problems
Proceedings of the 17th international conference on World Wide Web
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
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
Secretary problems and incentives via linear programming
ACM SIGecom Exchanges
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
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
Interviewing secretaries in parallel
Proceedings of the 13th ACM Conference on Electronic Commerce
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
Pricing mechanisms for crowdsourcing markets
Proceedings of the 22nd international conference on World Wide Web
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
Proceedings of the 22nd international conference on World Wide Web
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Dynamic dual adjustment of daily budgets and bids in sponsored search auctions
Decision Support Systems
Hi-index | 0.00 |
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 maximize the total value. Such situations arise in many contexts, e.g., hiring workers, scheduling jobs, and bidding in sponsored search auctions.This problem, often called the online knapsack problem, is known to be inapproximable. Therefore, we make the enabling assumption that elements arrive in a randomorder. Hence our problem can be thought of as a weighted version of the classical secretary problem, which we call the knapsack secretary problem. Using the random-order assumption, we design a constant-competitive algorithm for arbitrary weights and values, as well as a e-competitive algorithm for the special case when all weights are equal (i.e., the multiple-choice secretary problem). In contrast to previous work on online knapsack problems, we do not assume any knowledge regarding the distribution of weights and values beyond the fact that the order is random.