-
作者：Xu, Zhandong; Li, Zhengyang; Xie, Jun; Chen, Anthony; Liu, Xiaobo
作者单位：Southwest Jiaotong University; Hong Kong Polytechnic University
摘要：This study generalizes the single-class traffic assignment problem of Nikolova and Stier-Moses [Nikolova and Stier-Moses (2014) A mean-risk model for the traffic assignment problem with stochastic travel times. Oper. Res. 62(2):366-382] by considering the continuously distributed risk-aversion factor, termed the continuous mean-risk traffic assignment (CMRTA) problem. In CMRTA, travelers categorized into infinitely many user classes play a congestion routing game based on their risk attitude t...
-
作者：Han, Jiangze; Ryan, Christopher Thomas; Tong, Xin T.
作者单位：Columbia University; University of British Columbia; National University of Singapore
摘要：Loot boxes are a primary source of revenue in the video game industry. Loot boxes randomly drop items of differing value. To design a loot box, sellers must choose the loot box's purchase price and drop rate (or drop probability) of each item. We show that, in general, the loot box design problem is NP-hard. By restricting the form of player utilities, we can solve the problem exactly in polynomial time when the number of items is fixed. Under different restrictions, we solve the problem appro...
-
作者：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...
-
作者：Abdelhakmi, Anas; Lim, Andrew E. B.
作者单位：National University of Singapore; National University of Singapore; National University of Singapore
摘要：The Black-Litterman model is a framework for incorporating forward-looking expert views in a portfolio optimization problem. Existing work focuses almost exclusively on single-period problems with the forecast horizon matching that of the investor. We consider a generalization where the investor trades dynamically and views can be over horizons that differ from the investor. By exploiting the underlying graphical structure relating the asset prices and views, we derive the conditional distribu...
-
作者：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...
