Capacity Sharing and Cost Allocation among Independent Firms in the Presence of Congestion

We analyze the benefit of production/service capacity sharing for a set of independent firms. Firms have the choice of either operating their own production/service facilities or investing in a facility that is shared. Facilities are modeled as queueing systems with finite service rates. Firms decide on capacity levels (the service rate) to minimize delay costs and capacity investment costs possibly subject to service level constraints. If firms decide to operate a shared facility they must also decide on a scheme for sharing the costs. We formulate the problem as a cooperative game and identify a cost allocation that is in the core. The allocation rule charges every firm the cost of capacity for which it is directly responsible, its own delay cost, and a fraction of buffer capacity cost that is consistent with its contribution to this cost. In settings where unit delay costs are private information, the cooperative capacity sharing game becomes embedded with a non-cooperative information reporting game. We show how a cost allocation rule can be designed to induce all firms to report truthfully this information. Moreover, we show that, under this allocation rule, truth telling is a dominant strategy, with each firm reporting truthfully its private information regardless of the reporting decisions of other firms.

[1]  Shaler Stidham,et al.  On the Optimality of Single-Server Queuing Systems , 1970, Oper. Res..

[2]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[3]  T. Groves,et al.  Incentive Compatible Control of Decentralized Organizations , 1976 .

[4]  Martin P. Loeb,et al.  Incentives in a Divisionalized Firm , 1979 .

[5]  W. Whitt,et al.  Resource sharing for efficiency in traffic systems , 1981, The Bell System Technical Journal.

[6]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[7]  Susan L. Albin,et al.  Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..

[8]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[9]  Haim Mendelson,et al.  Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..

[10]  H. Mendelson,et al.  User delay costs and internal pricing for a service facility , 1990 .

[11]  Jr. Shaler Stidham Pricing and capacity decisions for a service facility: stability and multiple local optima , 1992 .

[12]  E. Kalai,et al.  Optimal service speeds in a competitive environment , 1992 .

[13]  Saifallah Benjaafar,et al.  Performance bounds for the effectiveness of pooling in multi-processing systems , 1995 .

[14]  H. Moulin Cooperative Microeconomics: A Game-Theoretic Introduction , 1995 .

[15]  John A. Buzacott,et al.  Commonalities in Reengineered Business Processes: Models and Issues , 1996 .

[16]  Diwakar Gupta,et al.  Machine Sharing in Manufacturing Systems : Flexibility versus Chaining , 1997 .

[17]  Avishai Mandelbaum,et al.  On Pooling in Queueing Networks , 1998 .

[18]  Albert Y. Ha,et al.  Incentive-Compatible Pricing for a Service Facility with Joint Production and Congestion Externalities , 1998 .

[19]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[20]  Albert Y. Ha Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements , 2001, Manag. Sci..

[21]  Moshe Shaked,et al.  The Newsvendor Game Has a Nonempty Core , 2002, Games Econ. Behav..

[22]  Wallace J. Hopp,et al.  Benefits of Skill Chaining in Production Lines with Cross-Trained Workers: An Extended Abstract , 2002, Manuf. Serv. Oper. Manag..

[23]  Richard Stong,et al.  Fair Queuing and Other Probabilistic Allocation Methods , 2002, Math. Oper. Res..

[24]  Patrick T. Harker,et al.  Competition and Outsourcing with Scale Economies , 2002, Manag. Sci..

[25]  François Maniquet,et al.  A characterization of the Shapley value in queueing problems , 2003, J. Econ. Theory.

[26]  Noah Gans,et al.  A Call-Routing Problem with Service-Level Constraints , 2003, Oper. Res..

[27]  M. Haviv,et al.  To Queue or Not to Queue , 2003 .

[28]  Eda Kemahlioglu Ziya Formal Methods of Value Sharing in Supply Chains , 2004 .

[29]  Fikri Karaesmen,et al.  Call Center Outsourcing Contract Design and Choice , 2004 .

[30]  Saif Benjaafar,et al.  Modeling and analysis of flexible queueing systems , 2004 .

[31]  Carmen Herrero,et al.  Optimal sharing of surgical costs in the presence of queues , 2004, Math. Methods Oper. Res..

[32]  William C. Jordan,et al.  Chained cross-training of workers for robust performance , 2004 .

[33]  Ward Whitt,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..

[34]  Saif Benjaafar,et al.  On the Benefits of Pooling in Production-Inventory Systems , 2005, Manag. Sci..

[35]  Seyed M. R. Iravani,et al.  Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations , 2005, Manag. Sci..

[36]  Jay Sethuraman,et al.  Cooperation in Queues , 2006 .

[37]  O. Zeynep Akşin,et al.  A REVIEW OF WORKFORCE CROSS-TRAINING IN CALL CENTERS FROM AN OPERATIONS MANAGEMENT PERSPECTIVE , 2007 .

[38]  Herbert Hamers,et al.  Economic Lot-Sizing Games , 2004, Eur. J. Oper. Res..

[39]  Awi Federgruen,et al.  Competition in Service Industries , 2005, Oper. Res..

[40]  Moshe Dror,et al.  Shipment Consolidation: Who Pays for It and How Much? , 2007, Manag. Sci..

[41]  Xin Chen,et al.  Duality Approaches to Economic Lot‐Sizing Games , 2007 .

[42]  Fuqiang Zhang,et al.  Obtaining Fast Service in a Queueing System via Performance-Based Allocation of Demand , 2007, Manag. Sci..

[43]  Noah Gans,et al.  Call-Routing Schemes for Call-Center Outsourcing , 2007, Manuf. Serv. Oper. Manag..

[44]  Awi Federgruen,et al.  Service Competition with General Queueing Facilities , 2006, Oper. Res..

[45]  Nash bargaining over inventory and pooling contracts , 2008 .

[46]  Mahesh Nagarajan,et al.  Game-Theoretic Analysis of Cooperation Among Supply Chain Agents: Review and Extensions , 2008, Eur. J. Oper. Res..

[47]  Jan A. Van Mieghem,et al.  A Little Flexibility is All You Need : Optimality of Tailored Chaining and Pairing * , 2008 .

[48]  Justo Puerto,et al.  Cooperation in Markovian queueing models , 2008, Eur. J. Oper. Res..

[49]  Yves Dallery,et al.  Analysis of the Impact of Team-Based Organizations in Call Center Management , 2008, Manag. Sci..

[50]  Wallace J. Hopp,et al.  Pooling strategies for call center agent cross-training , 2009 .

[51]  Xin Chen,et al.  A Stochastic Programming Duality Approach to Inventory Centralization Games , 2007, Oper. Res..