Approximation in stochastic scheduling: the power of LP-based priority policies
Journal of the ACM (JACM)
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Approximation algorithms for budgeted learning problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
Posted prices vs. negotiations: an asymptotic analysis
Proceedings of the 9th ACM conference on Electronic commerce
Approximating Matches Made in Heaven
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Multi-parameter mechanism design and sequential posted pricing
Proceedings of the forty-second ACM symposium on Theory of computing
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Improved analysis of the greedy algorithm for stochastic matching
Information Processing Letters
Mechanism design via correlation gap
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation results for stochastic knapsack problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Algorithmica - Special Issue: Algorithm Design and Analysis
Harnessing the power of two crossmatches
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
We study a general stochastic probing problem defined on a universe V, where each element e∈V is "active" independently with probability pe. Elements have weights {we:e∈V} and the goal is to maximize the weight of a chosen subset S of active elements. However, we are given only the pe values--to determine whether or not an element e is active, our algorithm must probe e. If element e is probed and happens to be active, then e must irrevocably be added to the chosen set S; if e is not active then it is not included in S. Moreover, the following conditions must hold in every random instantiation: the set Q of probed elements satisfy an "outer" packing constraint, the set S of chosen elements satisfy an "inner" packing constraint. The kinds of packing constraints we consider are intersections of matroids and knapsacks. Our results provide a simple and unified view of results in stochastic matching [1, 2] and Bayesian mechanism design [3], and can also handle more general constraints. As an application, we obtain the first polynomial-time Ω(1/k)-approximate "Sequential Posted Price Mechanism" under k-matroid intersection feasibility constraints, improving on prior work [3-5].