Operations Research

最新文章

• Competitive Equilibrium and Trading Networks: A Network Flow Approach AI翻译
  作者：Candogan, Ozan; Epitropou, Markos; Vohra, Rakesh V.
  作者单位：University of Chicago; University of Pennsylvania; University of Pennsylvania
  摘要：Under full substitutability of preferences, it is known that a competitive equilibrium exists in trading networks and is equivalent to (chain) stable outcomes. In this paper, we formulate the problem of finding an efficient set of trades as a generalized submodular flow problem in a suitable network. Existence of a competitive equilibrium and its equivalence with the seemingly weaker notion of stability follow directly from the optimality conditions of the flow problem. Our formulation enables...
• Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems AI翻译
  作者：Poursoltani, Mehran; Delage, Erick
  作者单位：Universite de Montreal; HEC Montreal; Universite de Montreal; HEC Montreal
  摘要：This paper explores the idea that two-stage worst-case regret minimization problems with either objective or right-hand side uncertainty can be reformulated as two-stage robust optimization problems and can therefore benefit from the solution schemes and theoretical knowledge that have been developed in the last decade for this class of problems. In particular, we identify conditions under which a first-stage decision can be obtained either exactly using popular adjustable robust optimization ...
• Now or Later? When to Deploy Qualification Screening in Open-Bid Auction for Re-Sourcing AI翻译
  作者：Zhang, Wen; Chen, Qi (George); Katok, Elena
  作者单位：Baylor University; University of London; London Business School; University of Texas System; University of Texas Dallas
  摘要：This paper considers a resourcing setting in which a qualified supplier (the incumbent) and multiple suppliers that have not yet been qualified (the entrants) compete in an open-bid descending auction for a single-supplier contract. Because of the risk of supplier nonperformance, the buyer only awards the contract to a qualified supplier; meanwhile, the buyer can conduct supplier qualification screening at a cost to verify whether the entrant suppliers can perform the contract. Conventionally,...
• Deferred Acceptance with Compensation Chains AI翻译
  作者：Dworczak, Piotr
  作者单位：Northwestern University
  摘要：I introduce a class of algorithms called deferred acceptance with compensation chains (DACC). DACC algorithms generalize the Gale-Shapley algorithm by allowing both sides of the market to make offers. The main result is a characterization of the set of stable matchings: a matching is stable if and only if it is the outcome of a DACC algorithm. The proof of convergence of DACC algorithms uses a novel technique based on a construction of a potential function.
• Demand Shaping Through Bundling and Product Configuration: A Dynamic Multiproduct Inventory-Pricing Model AI翻译
  作者：Song, Jing-Sheng; Xue, Zhengliang
  作者单位：Duke University; International Business Machines (IBM); IBM USA
  摘要：In today's digital age, with the aid of the internet and data mining, many firms use vertically differentiated product bundling to influence demand to match up with inventory status, especially in industries with short product life cycles. Despite this practice, there is little understanding on how exactly the inventory dynamics impact the bundling strategy and, in turn, how the bundling strategy affects the firm's inventory decisions. To fill this gap, we present a dynamic model to analyze th...
• A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs AI翻译
  作者：Zhu, Han; Chen, Youhua (Frank); Hu, Ming; Yang, Yi
  作者单位：Dongbei University of Finance & Economics; City University of Hong Kong; University of Toronto; Zhejiang University
  摘要：We study a continuous-review, two-echelon inventory system with one central warehouse, multiple local facilities, and each facility facing random demand. Local facilities replenish their stock from the central warehouse (or distribution center), which in turn places orders at an outside supplier with ample supply. Inventory replenishment at each location incurs a fixed-plus-variable cost for each shipment. The optimal policy remains unknown, and even if it exists, such a policy must be extreme...
• Constrained Assortment Optimization Under the Paired Combinatorial Logit Model AI翻译
  作者：Ghuge, Rohan; Kwon, Joseph; Nagarajan, Viswanath; Sharma, Adetee
  作者单位：University of Michigan System; University of Michigan
  摘要：Y We study the assortment optimization problem when customer choices are governed by the paired combinatorial logit model. We study unconstrained, cardinality-constrained, and knapsack-constrained versions of this problem, which are all known to be NP-hard. We design efficient algorithms that compute approximately optimal solutions, using a novel relation to the maximum directed cut problem and suitable linear-program rounding algorithms. We obtain a randomized polynomial time approximation sc...
• Technical Note-Approximating Systems Fed by Poisson Processes with Rapidly Changing Arrival Rates AI翻译
  作者：Zheng, Zeyu; Honnappa, Harsha; Glynn, Peter W.
  作者单位：University of California System; University of California Berkeley; Purdue University System; Purdue University; Stanford University
  摘要：This paper introduces a new asymptotic regime for simplifying stochastic models having nonstationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the arrival process to a service system has an arrival intensity that is fluctuating rapidly. We show that such a service system is well approximated by the corresponding model in which the arrival process is Poisson with a constant arrival rate. In addition to t...
• Patient-Type Bayes-Adaptive Treatment Plans AI翻译
  作者：Skandari, M. Reza; Shechter, Steven M.
  作者单位：Imperial College London; University of British Columbia
  摘要：Patient heterogeneity in disease progression is prevalent in many settings. Treatment decisions that explicitly consider this heterogeneity can lower the cost of care and improve outcomes by providing the right care for the right patient at the right time. In this paper, we analyze the problem of designing ongoing treatment plans for a population with heterogeneity in disease progression and response to medical interventions. We create a model that learns the patient type by monitoring the pat...
• Quantile Markov Decision Processes AI翻译
  作者：Li, Xiaocheng; Zhong, Huaiyang; Brandeau, Margaret L.
  作者单位：Stanford University
  摘要：The goal of a traditional Markov decision process (MDP) is to maximize expected cumulative reward over a defined horizon (possibly infinite). In many applications, however, a decision maker may be interested in optimizing a specific quantile of the cumulative reward instead of its expectation. In this paper, we consider the problem of optimizing the quantiles of the cumulative rewards of an MDP, which we refer to as a quantile Markov decision process (QMDP). We provide analytical results chara...