-
作者：Selvi, Aras; Liu, Huikang; Wiesemann, Wolfram
作者单位：Imperial College London; Shanghai Jiao Tong University
摘要：In recent years, differential privacy has emerged as the de facto standard for sharing statistics of data sets while limiting the disclosure of private information about the involved individuals. This is achieved by randomly perturbing the statistics to be published, which in turn, leads to a privacy-accuracy trade-off; larger perturbations provide stronger privacy guarantees, but they result in less accurate statistics that offer lower utility to the recipients. Of particular interest are, th...
-
作者：Lyu, Bochuan; Hicks, Illya, V; Huchette, Joey
作者单位：Rice University; Alphabet Inc.; Google Incorporated
摘要：We study mixed-integer programming formulations for the piecewise linear lower and upper bounds (in other words, piecewise linear relaxations) of nonlinear functions that can be modeled by a new class of combinatorial disjunctive constraints (CDCs), generalized nD-ordered CDCs. We first introduce a general formulation technique to model piecewise linear lower and upper bounds of univariate nonlinear functions concurrently so that it uses fewer binary variables than modeling bounds separately. ...
-
作者：Chen, Li; Sim, Melvyn; Zhang, Xun; Zhao, Long; Zhou, Minglong
作者单位：University of Sydney; National University of Singapore; Chinese Academy of Sciences; University of Science & Technology of China, CAS; Fudan University
摘要：We propose a new robust actionable prescriptive analytics framework that leverages past data and side information to minimize a risk-based objective function under distributional ambiguity. Our framework aims to find a policy that directly transforms the side information into implementable decisions. Specifically, we focus on developing actionable response policies that offer the benefits of interpretability and implementability. To address the potential issue of overfitting to empirical data,...
-
作者：Zubeldia, Martin; Jhunjhunwala, Prakirt R.; Maguluri, Siva Theja
作者单位：University of Minnesota System; University of Minnesota Twin Cities; Columbia University; University System of Georgia; Georgia Institute of Technology
摘要：Inspired by quantum switches, we consider a discrete-time multiway matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes and qubits from each node that can be used to serve the requests. An important feature of this model is that qubits decohere and so abandon over time. In contrast to classical server-based queueing models, the combination of queueing, server-less multiway matching, and (potentially correlated) abandonments make the analysis a c...
-
作者：Ge, Puyao; Kulkarni, Vidyadhar G.; Swaminathan, Tayashankar M.
作者单位：University of North Carolina; University of North Carolina Chapel Hill; University of North Carolina School of Medicine; University of North Carolina; University of North Carolina Chapel Hill; University of North Carolina School of Medicine
摘要：We consider the problem of allocating a single type of resource with limited supply to distinct groups, each with a finite population and characterized by a unique reward and arrival rate. We develop a stochastic model and formulate the problem as a Markov decision process. We study the structural properties of the optimal value function and derive the optimal allocation policy. Contrary to the conventional approach of incrementally extending access to groups of lower priority over time, our f...
-
作者：Mao, Cheng; Wu, Yihong; Xu, Jiaming; Yu, Sophie H.
作者单位：University System of Georgia; Georgia Institute of Technology; Yale University; Duke University; University of Pennsylvania
摘要：We propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex. For two Erdos-Renyi graphs G(n,q) whose edges are correlated through a latent vertex correspondence, we show that this algorithm correctly matches all but a vanishing fraction of the vertices with high probability, provided that nq -> infinity and the edge correlation coefficient rho satisfies rho(2) > alpha approximate to 0:338, wh...
-
作者：El Housni, Omar; Ibn Brahim, Marouane; Segev, Danny
作者单位：Cornell University; Tel Aviv University; Tel Aviv University
摘要：Motivated by modern-day applications such as attended home delivery and preference-based group scheduling, where decision makers wish to steer a large number of customers toward choosing the exact same alternative, we introduce a novel class of assortment optimization problems, referred to as maximum load assortment optimization. In such settings, given a universe of substitutable products, we are facing a stream of customers, each choosing between either selecting a product out of an offered ...
-
作者：Rath, Sandeep; Rajaram, Kumar; Hudson, Mark E.; Mahajan, Aman
作者单位：Indian School of Business (ISB); University of California System; University of California Los Angeles; Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
摘要：This paper presents the development, validation, and implementation of a datadriven optimization model designed to dynamically plan the assignment of anesthesiologists across multiple hospital locations within a large multispecialty healthcare system. We formulate the problem as a multistage robust mixed-integer program incorporating on-call flexibility to address demand uncertainty. In the first stage, anesthesiologists are assigned to specific locations or an on-call pool several weeks befor...
-
作者：Fan, Jianqing; Lou, Zhipeng; Wang, Weichen; Yu, Mengxin
作者单位：Princeton University; University of California System; University of California San Diego; University of Hong Kong; Washington University (WUSTL)
摘要：This paper studies the performance of the spectral method in the estimation and uncertainty quantification of the unobserved preference scores of compared entities in a general and more realistic setup. Specifically, the comparison graph consists of hyperedges of possible heterogeneous sizes, and the number of comparisons can be as low as one for a given hyper-edge. Such a setting is pervasive in real applications, circumventing the need to specify the graph randomness and the restrictive homo...
-
作者：Soh, Seung Bum; Gurvich, Itai
作者单位：Yonsei University; Northwestern University
摘要：Staffing problems are often formulated as satisfization problems, in which the cost of servers is minimized subject to quality of service constraints. These constraints indirectly capture customers' disutility from waiting or, at least, its structure. For the problem of staffing a single-class M/M/N queue with an average speed of answer (ASA) constraint, any work-conserving policy is optimal; the problem's formulation is, in that sense, ambiguous. One optimal solution is consistent with convex...
