-
作者：Angelopoulos, Spyros; Lidbetter, Thomas; Panagiotou, Konstantinos
作者单位：Centre National de la Recherche Scientifique (CNRS); Rutgers University System; Rutgers University Newark; Rutgers University New Brunswick; University of Munich
摘要：We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, or prediction, on the Hider's position. The objective is to establish tight tradeoffs between the consistency of a search strategy (i.e., its worst-case expected payoff assuming the prediction is correct) and its robustness (i.e., the worst-case expected payoff without any assumptions on the quality of the prediction). Our stu...
-
作者：You, Zhengzhong; Yang, Yu; Wang, Xinshang; Yin, Wotao
作者单位：State University System of Florida; University of Florida; State University System of Florida; University of Florida
摘要：Branching is one of the most important components in branch-price-and-cut (BPC) algorithms for solving vehicle routing problems (VRPs) exactly. However, learning to branch is much more challenging in BPC than in branch-and-cut algorithms that are used for solving general mixed integer programs because branching, in this case, is generally performed by adding a dense constraint to the restricted master problem (RMP), and meanwhile, the variables in the RMP change constantly. To address such cha...
-
作者：Chen, Zhuoxin; Ma, Will
作者单位：Tsinghua University; Columbia University; Columbia University
摘要：In the newsvendor problem, the goal is to guess the number that will be drawn from some distribution, with asymmetric consequences for guessing too high versus too low. In the data-driven version, the distribution is unknown, and one must work with samples from the distribution. The data-driven newsvendor problem has been studied under many variants: additive versus multiplicative regret, high-probability versus expectation bounds, and different distribution classes. This paper studies all com...
-
作者：Arlotto, Alessandro; Keskin, Irem Nur; Wei, Yehua
作者单位：Duke University
摘要：We study a joint inventory placement and online fulfillment model. In the beginning, the inventory is distributed to different warehouses. At each subsequent period, an order arrives from one of the demand regions, and the decision maker makes an irrevocable decision: whether to accept or reject the order and, if accepted, from which warehouse to fulfill it. To study this problem, we introduce the notion of joint (placement and fulfillment) regret, the regret of a given inventory placement and...
-
作者：Alimohammadi, Yeganeh; Borgs, Christian; van der Hofstad, Remco; Saberi, Amin
作者单位：University of Southern California; University of California System; University of California Berkeley; Eindhoven University of Technology; Stanford University
摘要：We study susceptible-infected (SI), susceptible-infected-removed (SIR), and related epidemic models in which infected individuals transition to an absorbing state, such as recovery or permanent infectiousness. In addition to infectious diseases, these models are used for studying the diffusion of innovations in which new behaviors, opinions, conventions, and technologies propagate from person to person through a social network. We focus on the key challenge of forecasting epidemic trajectory a...
-
作者：Adams, Katherine B.; Boutilier, Justin J.; Deo, Sarang; Mintz, Yonatan
作者单位：University of Texas System; University of Texas at San Antonio; University of Ottawa; Indian School of Business (ISB); University of Wisconsin System; University of Wisconsin Madison
摘要：Diabetes is a global health priority, especially in low-and middle-income countries, where over 50% of premature deaths are attributed to high blood glucose. Community health worker (CHW) programs can provide affordable and culturally tailored solutions for early detection and management of diabetes. We introduce an optimization framework to determine personalized CHW visits that maximize glycemic control at a community level. Our framework explicitly models the trade-off between screening new...
-
作者：Peng, Chengyuan; Stachurski, John
作者单位：Capital University of Economics & Business; National Graduate Institute for Policy Studies
摘要：New approaches to the theory of dynamic programming view dynamic programs as families of policy operators acting on partially ordered sets. In this paper, we extend these ideas by shifting from arbitrary partially ordered sets to ordered vector spaces. The integrated algebraic and order structure in such spaces leads to sharper fixed-point results. These fixed-point results can then be exploited to obtain optimality properties. We illustrate our results through applications ranging from firm m...
-
作者：Olver, Neil; Sering, Leon; Koch, Laura Vargas
作者单位：University of London; London School Economics & Political Science; RWTH Aachen University
摘要：We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over time, and congestion effects are modeled via queues, which form whenever the inflow into a link exceeds its capacity. Despite lots of interest, some very basic questions remain open in this model. We resolve a number of them in the single-commodity setting: (...
-
作者：Tobey, Margaret; Mayorga, Maria E.; Bosisto, Sherrie; Ozaltin, Osman Y.
作者单位：North Carolina State University
摘要：Human trafficking investigators face challenges when processing the sheer volume of publicly available online data. Natural language processing (NLP) models can assist in identifying evidence of exploitation in text data, such as business reviews. However, the scarcity of large and accurately labeled training data sets hinders the potential for NLP-based detection algorithms. Labeling data sets related to human trafficking is challenging because identifying indicators of trafficking requires d...
-
作者：Tian, Feng; Zhang, Feifan; Sun, Peng; Duenyas, Izak
作者单位：University of Hong Kong; Duke University; University of Michigan System; University of Michigan
摘要：We study dynamic contracts that incentivize an agent to exert effort to increase the arrival rate of a Poisson breakthrough, where both the effort cost and the effort level at any time are the agent's private information. Optimally, the principal offers a menu of contracts, each tailored to an agent type (with a different effort cost), specifying an initial payment, a contract deadline, and a payment-upon-arrival process over time. We first fully characterize the optimal contract menu in a two...
