Design and analysis of mechanisms for decentralized joint replenishment

被引:7
|
作者
Guler, Kemal [1 ]
Korpeoglu, Evren [2 ]
Sen, Alper [3 ]
机构
[1] Anadolu Univ, Fac Econ & Adm Sci, Dept Econ, TR-26470 Eskisehir, Turkey
[2] WalmartLabs, San Bruno, CA 94066 USA
[3] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
关键词
Game Theory; Inventory; Joint replenishment; Economic Order Quantity model; Mechanism design; COST ALLOCATION; INVENTORY GAMES; COOPERATION; EFFICIENT; MODELS;
D O I
10.1016/j.ejor.2016.11.029
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider jointly replenishing multiple firms that operate under an EOQ like environment in a decentralized, non-cooperative setting. Each firm's demand rate and inventory holding cost rate are private information. We are interested in finding a mechanism that would determine the joint replenishment frequency and allocate the joint ordering costs to these firms based on their reported stand-alone replenishment frequencies (if they were to order independently). We first provide an impossibility result showing that there is no direct mechanism that simultaneously achieves efficiency, incentive compatibility, individual rationality and budget-balance. We then propose a general, two-parameter mechanism in which one parameter is used to determine the joint replenishment frequency, another is used to allocate the order costs based on firms ' reports. We show that efficiency cannot be achieved in this two-parameter mechanism unless the parameter governing the cost allocation is zero. When the two parameters are same (a single parameter mechanism), we find the equilibrium share levels and corresponding total cost. We finally investigate the effect of this parameter on equilibrium behavior. We show that properly adjusting this parameter leads to mechanisms that are better than other mechanisms suggested earlier in the literature in terms of fairness and efficiency. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:992 / 1002
页数:11
相关论文
共 50 条
  • [21] Altruistic profit allocation rules for joint replenishment with carbon cap-and-trade policy
    Feng, Hairong
    Zeng, Yinlian
    Cai, Xiaoqiang
    Qian, Qian
    Zhou, Yongwu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (03) : 956 - 967
  • [22] Effective heuristics for the dynamic demand joint replenishment problem
    Robinson, E. P.
    Narayanan, A.
    Gao, L-L
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (06) : 808 - 815
  • [23] Efficient methods for stochastic joint replenishment and delivery problem
    Wang, Sirui
    Wang, Lin
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (04) : 2288 - 2315
  • [24] Allocation rules for joint replenishment and inventory sharing via transshipment
    Shi, Xuefei
    Wang, Haiyan
    Xue, Weili
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES 2019), 2019, 159 : 1872 - 1879
  • [25] A dynamic joint replenishment policy with auto-correlated demand
    Lee, LH
    Chew, EP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (03) : 729 - 747
  • [26] A simple improvement on Silver's heuristic for the joint replenishment problem
    Nilsson, A.
    Silver, E. A.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (10) : 1415 - 1421
  • [27] Coordinated Logistics: Joint Replenishment with Capacitated Transportation for a Supply Chain
    Buyukkaramikli, Nasuh C.
    Gurler, Ulku
    Alp, Osman
    PRODUCTION AND OPERATIONS MANAGEMENT, 2014, 23 (01) : 110 - 126
  • [28] Joint replenishment and carbon trading in fresh food supply chains
    Wang, Min
    Zhao, Lindu
    Herty, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (02) : 561 - 573
  • [29] The joint replenishment problem: Optimal policy and exact evaluation method
    Creemers, Stefan
    Boute, Robert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (03) : 1175 - 1188
  • [30] Efficient algorithms for the joint replenishment problem with minimum order quantities
    Muriel, Ana
    Chugh, Tammana
    Prokle, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (01) : 137 - 150