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-articleSeptember 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 ...
- research-articleAugust 2023
Domain-Specific Risk Minimization for Domain Generalization
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 3409–3421https://doi.org/10.1145/3580305.3599313Domain generalization (DG) approaches typically use the hypothesis learned on source domains for inference on the unseen target domain. However, such a hypothesis can be arbitrarily far from the optimal one for the target domain, induced by a gap termed ...
- extended-abstractJune 2019
Pandora's Problem with Nonobligatory Inspection
EC '19: Proceedings of the 2019 ACM Conference on Economics and ComputationPages 131–132https://doi.org/10.1145/3328526.3329626Martin Weitzman's "Pandora's problem" furnishes the mathematical basis for optimal search theory in economics. Nearly 40 years later, Laura Doval introduced a version of the problem in which the searcher is not obligated to pay the cost of inspecting an ...
- articleFebruary 2015
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
Mathematics of Operations Research (MOOR), Volume 40, Issue 1Pages 56–79https://doi.org/10.1287/moor.2014.0656In the stochastic orienteering problem, we are given a finite metric space, where each node contains a job with some deterministic reward and a random processing time. The processing time distributions are known and independent across nodes. However the ...