-
作者：Chen, Li; Song, Jing-Sheng; Zhang, Yue
作者单位：Cornell University; Duke University; Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park
摘要：We study Inventory control of serial supply chains with continuous, Markov-modulated demand (MMD). Our goal is to simplify the computational complexity by resorting to certain approximation techniques, and, in doing so, to gain a deeper understanding of the problem. First, we perform a derivative analysis of the problem's optimality equations and develop general, analytical solution bounds for the optimal policy. This leads to simple-to-compute near-optimal heuristic solutions, which also reve...
-
作者：Feldman, Jacob B.; Topaloglu, Huseyin
作者单位：Washington University (WUSTL)
摘要：We consider revenue management problems when customers choose among the offered products according to the Markov chain choice model. In this choice model, a customer arrives Into the system to purchase a particular product. If this product Is available for purchase, then the customer purchases It. Otherwise, the customer transitions to another product or to the no purchase option, until she reaches an available product or the no purchase option. We consider three classes of problems. First, we...
-
作者：Balseiro, Santiago R.; Candogan, Ozan
作者单位：Duke University; University of Chicago
摘要：In online advertising, the prevalent method advertisers employ to acquire impressions is to contract with an intermediary. These contracts involve upfront payments made by the advertisers to the intermediary, in exchange for running campaigns on their behalf. This paper studies the optimal contract offered by the intermediary in a setting where advertisers' budgets and targeting criteria are private. This problem can naturally be formulated as a multidimensional mechanism design problem, which...
-
作者：Atamturk, Alper; Gomez, Andres
作者单位：University of California System; University of California Berkeley
摘要：Given a polytope X, a monotone concave univariate function g, and two vectors c and d, we study the discrete optimization problem of finding a vertex of X that maximizes the utility function c'x + g(d'x). This problem has numerous applications in combinatorial optimization with a probabilistic objective, including estimation of project duration with stochastic times, in reliability models, in multinomial logit models and in robust optimization. We show that the problem is NP-hard for any stric...
-
作者：Correa, Jose; Harks, Tobias; Kreuzen, Vincent J. C.; Matuschke, Jannik
作者单位：Universidad de Chile; University of Augsburg; Maastricht University; Technical University of Munich
摘要：Public transit systems in major urban areas usually operate under deficits and therefore require significant subsidies. An important cause of this deficit, particularly in the developing world, is the high fare evasion rate mainly due to an ineffective control policy or the lack of it. In this paper we study new models for optimizing fare inspection strategies in transit networks based on bilevel programming. In the first level, the leader (the network operator) determines probabilities for in...
-
作者：Lu, Tao; Fransoo, Jan C.; Lee, Chung-Yee
作者单位：Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; Eindhoven University of Technology; Hong Kong University of Science & Technology
摘要：Many seasonal products are transported via ocean carriers from origin to destination markets. The shipments arriving earlier in the market may sell at higher prices, but faster shipping services can be costly. In this paper, we study a newsvendor-type shipper who transports and sells seasonal products to an overseas market, where the selling price declines over time. A set of vessels with different schedules and freight rates are available to choose from. Our analysis demonstrates that a portf...
-
作者：Feng, Guiyun; Li, Xiaobo; Wang, Zizhuo
作者单位：University of Minnesota System; University of Minnesota Twin Cities
摘要：In this paper, we study the relationship between several well known classes of discrete choice models, i.e., the random utility model (RUM), the representative agent model (RAM), and the semiparametric choice model (SCM). Using a welfare-based model as an intermediate, we show that the RAM and the SCM are equivalent. Furthermore, we show that both models as well as the welfare-based model strictly subsume the RUM when there are three or more alternatives, while the four are equivalent when the...
-
作者：Bramson, Maury; D'Auria, Bernardo; Walton, Neil
作者单位：University of Minnesota System; University of Minnesota Twin Cities; Universidad Carlos III de Madrid; University of Manchester
摘要：We consider a family of discrete time multihop switched queueing networks where each packet moves along a fixed route. In this setting, BackPressure is the canonical choice of scheduling policy; this policy has the virtues of possessing a maximal stability region and not requiring explicit knowledge of traffic arrival rates. BackPressure has certain structural weaknesses because implementation requires information about each route, and queueing delays can grow super-linearly with route length....
-
作者：Budish, Eric; Cachon, Gerard P.; Kessler, Judd B.; Othman, Abraham
作者单位：University of Chicago; University of Chicago; University of Pennsylvania; University of Pennsylvania; University of Pennsylvania; University of Pennsylvania
摘要：Combinatorial allocation involves assigning bundles of items to agents when the money is not allowed. Course allocation is one common application of combinatorial allocation, in which the bundles are schedules of courses and the assignees are students. Existing mechanisms used in practice have been shown to have serious flaws, which lead to allocations that are inefficient, unfair, or both. A recently developed mechanism is attractive in theory but has several features that limit its feasibili...
-
作者：He, Simai; Sethuraman, Jay; Wang, Xuan; Zhang, Jiawei
作者单位：Shanghai University of Finance & Economics; Columbia University; Hong Kong University of Science & Technology; New York University; New York University; NYU Shanghai
摘要：We consider the infinite-horizon multiple retailer joint replenishment problem with first-order interaction. In this model, the joint setup cost incurred by a group of retailers placing an order simultaneously consists of a group-independent major setup cost and retailer-specific minor setup costs. The goal is to determine an inventory replenishment policy that minimizes the long-run average system-wide cost. In this paper, we adopt a noncooperative approach to study the joint replenishment ga...
