-
作者：Yang, Mingwei; Yu, Sophie H.
作者单位：Stanford University; University of Pennsylvania
摘要：We study the online metric matching problem. There are m servers and n requests located in a metric space, where all servers are available up front and requests arrive one at a time. Upon the arrival of a new request, it needs to be immediately and irrevocably matched to an available server, resulting in a cost of their distance. The objective is to minimize the total matching cost. When servers are adversarial and requests are independently drawn from a known distribution, we reduce the probl...
-
作者：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
摘要：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 Kunshan University; 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...
-
作者：Balseiro, Santiago R.; Kroer, Christian; Kumar, Rachitesh
作者单位：Columbia University; Columbia University; Carnegie Mellon University
摘要：Single-leg revenue management is a foundational problem of revenue management that has been particularly impactful in the airline and hotel industry: Given n units of a resource, for example, flight seats, and a stream of sequentially arriving customers segmented by fares, what is the optimal online policy for allocating the resource? Previous work focused on designing algorithms when forecasts are available, which are not robust to inaccuracies in the forecast, or online algorithms with worst...
-
作者：Li, Zhouzi; Gurushankar, Keerthana; Harchol-Balter, Mor; Scheller-Wolf, Alan
作者单位：Carnegie Mellon University; Carnegie Mellon University
摘要：Scheduling a stream of jobs whose holding cost changes over time is a classic and practical problem. Specifically, each job is associated with a holding cost (penalty), and a job's instantaneous holding cost is some nondecreasing function of its class and current age (the time it has spent in the system since its arrival). The goal is to schedule the jobs to minimize the time-average total holding cost across all jobs. The seminal paper on this problem, by Van Mieghem in 1995, introduced the g...
-
作者：Cheung, Wang Chi; Lyu, Guodong
作者单位：National University of Singapore; Hong Kong University of Science & Technology
摘要：A central issue in (finite horizon) online planning problems is to synthesize the impact of real-time decisions on the subsequent states of the system and the performance in the remaining time horizon (cost-to-go function). A complete resolution often leads to intractable dynamic programming problems. We propose a computationally efficient approach to this problem that attains near-optimal performance in nonstationary environments. More specifically, we study a general class of online planning...
