-
作者：Zhou, Quan; Gumus, Mehmet; Miao, Sentao
作者单位：McGill University; University of Colorado System; University of Colorado Boulder
摘要：We explore the optimization of the middle-mile fulfillment process in the context of e-commerce. In collaboration with a prominent e-commerce retailer in North America specializing in electronics and computer products, we develop a stochastic optimization problem to demonstrate how an efficient middle mile can alleviate strain on the critical last mile, leading to cost reduction and improved performance. First, we prove that the optimal policy is of a state-dependent threshold type. However, c...
-
作者：Zhao, Yanyang; Wang, Xinshang; Xin, Linwei
作者单位：University of Chicago; Alibaba Group
摘要：The global e-commerce boom has driven rapid expansion of fulfillment infrastructure, with e-retailers building more warehouses to offer faster deliveries. However, fulfillment costs have surged over the past decade. This paper addresses the problem of minimizing these costs, where an e-retailer must decide in real time which warehouse(s) will fulfill each order, considering inventory constraints. Orders can be split among warehouses at an additional cost. We focus on a regional distribution ce...
-
作者：Farina, Gabriele; Kroer, Christian; Sandholm, Tuomas
作者单位：Columbia University; Carnegie Mellon University
摘要：We study the application of iterative first-order methods to the problem of computing equilibria of large-scale extensive-form games. First-order methods must typically be instantiated with a regularizer that serves as a distance-generating function (DGF) for the decision sets of the players. In this paper, we introduce a new weighted entropy-based distance-generating function. We show that this function is equivalent to a particular set of new weights for the dilated entropy distance-generati...
-
作者：Gupta, Diwakar; Schmitt, Matt; Stamatopoulos, Ioannis
作者单位：University of Texas System; University of Texas Austin
摘要：In many simultaneous auction settings, such as government procurement auctions, there may be linkages across items, in that the value a bidder places on one item depends on whether the same bidder also wins others. Applying this idea to auctions run by Minnesota's Department of Transportation (MnDOT), we show how firms' observed bidding behavior can reveal the existence and magnitude of such cross-auction linkages. MnDOT holds auctions annually to procure road salt for each of its depots (stor...
-
作者：Carvalho, Margarida; Dragotto, Gabriele; Lodi, Andrea; Sankaranarayanan, Sriram
作者单位：Universite de Montreal; Princeton University; Technion Israel Institute of Technology; Indian School of Business (ISB)
摘要：We introduce Cut-and-Play, a practically efficient algorithm for computing Nash equilibria in simultaneous noncooperative games where players decide via nonconvex and possibly unbounded optimization problems with separable payoff functions. Our algorithm exploits an intrinsic relationship between the equilibria of the original nonconvex game and the ones of a convexified counterpart. In practice, Cut-and-Play formulates a series of convex approximations of the game and iteratively refines them...
-
作者：Miao, Sentao; Jasin, Stefanus; Chao, Xiuli
作者单位：University of Colorado System; University of Colorado Boulder; University of Michigan System; University of Michigan; University of Michigan System; University of Michigan
摘要：We consider a firm managing a multiperiod, multiwarehouse, multistore (MWMS) inventory problem with fixed ordering cost at each store over a finite time horizon. The warehouses are endowed with initial inventories at the start of the horizon, and the stores are periodically replenished from the warehouses. The decisions are the order quantities from each store at each period. The optimal policy for this problem is complex and computationally intractable. We construct a mixed (s, S) policy base...
-
作者：Belotti, Pietro; Buchanan, Austin; Ezazipour, Soraya
作者单位：Polytechnic University of Milan; Oklahoma State University System; Oklahoma State University - Stillwater
摘要：In the academic literature and in expert testimony, the Polsby-Popper score is the most popular way to measure the compactness of a political district. Given a district with area A and perimeter P, its Polsby-Popper score is given by (4 pi A)=P2. This score takes values between zero and one, with circular districts achieving a perfect score of one. In this paper, we propose the first mathematical optimization models to draw districts (or districting plans) with optimum Polsby-Popper score. Spe...
