-
作者：Erazo, Ignacio; Toriello, Alejandro
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：Motivated by applications in e-commerce logistics where orders or items arrive at different times and must be dispatched or processed in batches, we propose the subadditive dispatching problem (SAD), a strongly NP-hard problem defined by a set of orders with release times and a nondecreasing subadditive dispatch time function. A single uncapacitated vehicle must dispatch orders in batches to minimize the makespan, the time at which all orders have been dispatched. We propose a mixed-integer li...
-
作者：Postek, Krzysztof; Romeijnders, Ward; Wiesemann, Wolfram
作者单位：Delft University of Technology; University of Groningen; Imperial College London
摘要：Multistage robust optimization, in which decisions are taken sequentially as new information becomes available about uncertain problem parameters, is a very versatile yet computationally challenging paradigm for decision making under uncertainty. In this technical note, we propose a new model and solution approach for multistage robust mixed-integer programs, which may contain both continuous and discrete decisions at any time stage. Our model builds upon the finite adaptability scheme develop...
-
作者：Fan, Weiwei; Li, Xuewen; Luo, Jun; Tsai, Shing Chih
作者单位：Tongji University; Shanghai Jiao Tong University; National Cheng Kung University
摘要：Ranking-and-selection (R&S) procedures, which seek to select the best system among a finite set of stochastic systems, often conduct a first-stage sampling to estimate the unknown variances of the systems. In this paper, we assume that system samples are normally distributed and demonstrate that the first-stage sample size n0 affects the performance of sequential R&S procedures in the manner beyond variance estimations. Specifically, we prove that the presence of n0 could reduce the achieved p...
-
作者：Spiers, Sandy; Bui, Hoa T.; Loxton, Ryan
摘要：The Euclidean max-sum diversity problem becomes substantially more difficult as the number of coordinates increases despite the number of decision variables not changing. In this paper, we overcome this complexity by constructing a new set of locations whose squared Euclidean distances equal that of the original. Using squared distances allows the objective function to be decomposed into the sum of pairwise distances within each coordinate. A partition set of the coordinates is then used to en...
-
作者：Ozel, Aysu; Smilowitz, Karen; Goldstein, Lila K. S.
作者单位：Northwestern University
摘要：Comprehensive community engagement in public school district design is essential to create equitable and effective enrollment policies reflective of community needs and values. We revisit the school district design problem with a focus on codesigning with community partners. We introduce a new compact formulation that incorporates multiple decisions simultaneously by assigning students in each geographic unit to a set of schools (e.g., elementary, middle, and high schools, and schools with spe...
-
作者：Bui, Ngoc; Nguyen, Duy; Yue, Man-Chung; Nguyen, Viet Anh
作者单位：Yale University; University of North Carolina; University of North Carolina Chapel Hill; University of Hong Kong; Chinese University of Hong Kong
摘要：Algorithmic recourse emerges as a prominent technique to promote the explainability, transparency, and ethics of machine learning models. Existing algorithmic recourse approaches often assume an invariant predictive model; however, the predictive model is usually updated on the arrival of new data. Thus, a recourse that is valid respective to the present model may become in valid for the future model. To resolve this issue, we propose a novel framework to generate a model-agnostic recourse tha...
-
作者：Berczi, Kristof; Codazzi, Laura; Golak, Julian; Grigoriev, Alexander
作者单位：Eotvos Lorand University; Eotvos Lorand University; Hamburg University of Technology; University of Hamburg; Maastricht University
摘要：In combinatorial markets, the goal is typically to determine a pair of pricing and allocation of items that results in an efficient distribution of resources or maximizes the seller's profit. In dynamic pricing schemes, agents arrive in an unspecified sequential order, and the prices can be updated between agent arrivals, which makes the concept fairness of dynamic prices highly nontrivial. In markets with expected price deflation, typical agent follows the prices prior to their purchase and b...
-
作者：Goyal, Vineet; Iyengar, Garud; Udwani, Rajan
作者单位：Columbia University; University of California System; University of California Berkeley
摘要：We consider the problem of online allocation (matching, budgeted allocations, and assortments) of reusable resources for which an adversarial sequence of resource requests is revealed over time and any allocated resource is used/rented for a stochastic duration drawn independently from a resource-dependent usage distribution. Previously, it was known that a greedy algorithm is 0.5-competitive against the clairvoyant benchmark that knows the entire sequence of requests in advance. We give a nov...
-
作者：Benade, Gerdus; Halpern, Daniel; Psomas, Alexandros
作者单位：Boston University; Harvard University; Purdue University System; Purdue University
摘要：We consider the fundamental problem of fairly and efficiently allocating T indivisible items among n agents with additive preferences. Items become available over a sequence of rounds, and every item must be allocated immediately and irrevocably before the next one arrives. Previous work shows that when the agents' valuations for the items are drawn from known distributions, it is possible (under mild assumptions) to find allocations that are envy-free with high probability and Pareto efficien...
-
作者：Bertani, Nicollo; Jensen, Shane T.; Satopaa, Ville A.
作者单位：Universidade Catolica Portuguesa; University of Pennsylvania; INSEAD Business School
摘要：This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact permissions@informs.org. The Publisher does not warrant or guarantee the article's accuracy, completeness, merchantability, fitness inclusion of an advertisement in this article, neither constitutes nor implies a guaran...
