Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleFebruary 2024
Selection and Ordering Policies for Hiring Pipelines via Linear Programming
Hiring the right person for the job is crucial for the success of any organization. In “Selection and Ordering Policies for Hiring Pipelines via Linear Programming,” Epstein and Ma study several problems motivated by a firm that is carrying out a ...
Motivated by hiring pipelines, we study three selection and ordering problems in which applicants for a finite set of positions are interviewed or sent offers. There is a finite time budget for interviewing/sending offers, and every interview/offer is ...
- extended-abstractJuly 2021
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems
EC '21: Proceedings of the 22nd ACM Conference on Economics and ComputationPages 793–794https://doi.org/10.1145/3465456.3467614Our main contribution is a general framework to design efficient polynomial time approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization problems. Given an error parameter ε>0, such algorithmic schemes attain a (1-ε)-...
- research-articleJanuary 2021
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems
SIAM Journal on Computing (SICOMP), Volume 50, Issue 2Pages 255–300https://doi.org/10.1137/18M1226130We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call ...
- research-articleOctober 2018
Stochastic Coupon Probing in Social Networks
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementPages 1023–1031https://doi.org/10.1145/3269206.3271771CMO Council reports that 71% of internet users in the U.S. were influenced by coupons and discounts when making their purchase decisions. It has also been shown that offering coupons to a small fraction of users may affect the purchase decisions of many ...
- research-articleJanuary 2016
Online contention resolution schemes
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithmsPages 1014–1033We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we ...