-
作者：Farahat, Amr; Perakis, Georgia
作者单位：Cornell University; Massachusetts Institute of Technology (MIT)
摘要：We compare equilibrium profits of Bertrand (price) and Cournot (quantity) competition in oligopolies with an arbitrary number of nonsymmetric firms offering differentiated substitutable products under an affine demand function. We provide a precise characterization of the profit relationship in terms of (1) the number of firms, (2) their relative quality and cost differences, and (3) the competition intensity, defined as the maxiumum absolute value of total change in competitors' demand over c...
-
作者：Benjaafar, Saif; ElHafsi, Mohsen; Lee, Chung-Yee; Zhou, Weihua
作者单位：University of Minnesota System; University of Minnesota Twin Cities; University of California System; University of California Riverside; Hong Kong University of Science & Technology; Zhejiang University
摘要：We consider an assembly system with multiple stages, multiple items, and multiple customer classes. The system consists of m production facilities, each producing a different item. Items are produced in variable batch sizes, one batch at a time, with exponentially distributed batch production times. Demand from each class takes place continuously over time according to a compound Poisson process. At each decision epoch, we must determine whether or not to produce an item and, should demand fro...
-
作者：Giesecke, Kay; Goldberg, Lisa R.; Ding, Xiaowei
作者单位：Stanford University; MSCI Inc.; Morgan Stanley
摘要：A multiname credit derivative is a security that is tied to an underlying portfolio of corporate bonds and has payoffs that depend on the loss due to default in the portfolio. The value of a multiname derivative depends on the distribution of portfolio loss at multiple horizons. Intensity-based models of the loss point process that are specified without reference to the portfolio constituents determine this distribution in terms of few economically meaningful parameters and lead to computation...
-
作者：Kardes, Erim; Ordonez, Fernando; Hall, Randolph W.
作者单位：University of Southern California; Universidad de Chile
摘要：This paper presents a robust optimization model for n-person finite state/action stochastic games with incomplete information. We consider nonzero sum discounted stochastic games in which none of the players knows the true data of a game, and each player adopts a robust optimization approach to address the uncertainty. We call these games discounted robust stochastic games. Such games allow us to use simple uncertainty sets for the unknown data and eliminate the need to have an a-priori probab...
-
作者：Bikhchandani, Sushil; de Vries, Sven; Schummer, James; Vohra, Rakesh V.
作者单位：University of California System; University of California Los Angeles; Universitat Trier; Northwestern University
摘要：Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when the seller is constrained to sell bundles whose elements form a basis of a matroid. It extends easily to polymatroids. Applications include scheduling, allocation of homogeneous goods, and spatially distributed markets, among others. Our ascending auction induces buyers to bid truthfully and returns the economically e...
-
作者：Baldacci, Roberto; Bartolini, Enrico; Mingozzi, Aristide
作者单位：University of Bologna; University of Bologna; University of Bologna
摘要：The pickup and delivery problem with time windows (PDPTW) is a generalization of the vehicle routing problem with time windows. In the PDPTW, a set of identical vehicles located at a central depot must be optimally routed to service a set of transportation requests subject to capacity, time window, pairing, and precedence constraints. In this paper, we present a new exact algorithm for the PDPTW based on a set-partitioning-like integer formulation, and we describe a bounding procedure that fin...
-
作者：Kim, Sunkyo
作者单位：Ajou University
摘要：In two-moment decomposition approximations of queueing networks, the arrival process is modeled as a renewal process, and each station is approximated as a GI/G/1 queue whose mean waiting time is approximated based on the first two moments of the interarrival times and the service times. The departure process is also approximated as a renewal process even though the autocorrelation of this process may significantly affect the performance of the subsequent queue depending on the traffic intensi...
-
作者：Zhou, Sean X.; Yu, Yikun
作者单位：Chinese University of Hong Kong
摘要：Acquisition of used products ( cores) is central to the success of remanufacturing programs for companies. At the same time, dynamic pricing strategies have been adopted in various industries to better balance supply and customer demand. In this paper, we study the integration of these two aspects of operations together with inventory management for a production/remanufacturing firm. We develop a periodic-review single-product inventory system with price-dependent customer demand. The product ...
-
作者：Turner, John; Scheller-Wolf, Alan; Tayur, Sridhar
作者单位：University of California System; University of California Irvine; Carnegie Mellon University
摘要：Dynamic in-game advertising is a new form of advertising in which ads are served to video game consoles in real time over the Internet. We present a model for the in-game ad-scheduling problem faced by Massive Inc., a wholly owned subsidiary of Microsoft, and a leading global network provider of in-game ad space. Our model has two components: (1) a linear program (solved periodically) establishes target service rates, and (2) a real-time packing heuristic (run whenever a player enters a new le...
-
作者：Bertsimas, Dimitris; Farias, Vivek F.; Trichakis, Nikolaos
作者单位：Massachusetts Institute of Technology (MIT)
摘要：In this paper we study resource allocation problems that involve multiple self-interested parties or players and a central decision maker. We introduce and study the price of fairness, which is the relative system efficiency loss under a fair allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. We focus on two well-accepted, axiomatically justified notions of fairness, viz., proportional fairness and max-min fairness. For these notions we pro...
