Allocation of cost savings in a three-level supply chain with demand information sharing : a cooperative game approach

Mingming LENG, Mahmut PARLAR

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

63 Citations (Scopus)

Abstract

We analyze the problem of allocating cost savings from sharing demand information in a three-level supply chain with a manufacturer, a distributor, and a retailer. To find a unique allocation scheme, we use concepts from cooperative game theory. First, we analytically compute the expected cost incurred by the manufacturer and then use simulation to obtain expected costs for the distributor and the retailer. We construct a three-person cooperative game in characteristic-function form and derive necessary conditions for the stability of each of five possible coalitions. To divide the cost savings between two members, or among three supply chain members, we use various allocation schemes. We present numerical analyses to investigate the impacts of the demand autocorrelation coefficient, ρ, and the unit holding and shortage costs on the allocation scheme.
Original languageEnglish
Pages (from-to)200-213
Number of pages14
JournalOperations Research
Volume57
Issue number1
DOIs
Publication statusPublished - 1 Jan 2009

Fingerprint

Supply chains
Costs
Game theory
Autocorrelation
Supply chain
Cooperative game
Information sharing
Cost savings
Retailers
Distributor
Shortage
Characteristic function
Coefficients
Cooperative game theory
Simulation

Keywords

  • Nash arbitration scheme
  • Shapley value
  • constrained core
  • constrained nucleolus solution
  • cooperative
  • cooperative game theory
  • games/group decisions
  • information sharing
  • inventory/production
  • simulation
  • supply chain management

Cite this

@article{297a88754a4b48378587585e96c53c78,
title = "Allocation of cost savings in a three-level supply chain with demand information sharing : a cooperative game approach",
abstract = "We analyze the problem of allocating cost savings from sharing demand information in a three-level supply chain with a manufacturer, a distributor, and a retailer. To find a unique allocation scheme, we use concepts from cooperative game theory. First, we analytically compute the expected cost incurred by the manufacturer and then use simulation to obtain expected costs for the distributor and the retailer. We construct a three-person cooperative game in characteristic-function form and derive necessary conditions for the stability of each of five possible coalitions. To divide the cost savings between two members, or among three supply chain members, we use various allocation schemes. We present numerical analyses to investigate the impacts of the demand autocorrelation coefficient, ρ, and the unit holding and shortage costs on the allocation scheme.",
keywords = "Nash arbitration scheme, Shapley value, constrained core, constrained nucleolus solution, cooperative, cooperative game theory, games/group decisions, information sharing, inventory/production, simulation, supply chain management",
author = "Mingming LENG and Mahmut PARLAR",
year = "2009",
month = "1",
day = "1",
doi = "10.1287/opre.1080.0528",
language = "English",
volume = "57",
pages = "200--213",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Institute for Operations Research and the Management Sciences",
number = "1",

}

Allocation of cost savings in a three-level supply chain with demand information sharing : a cooperative game approach. / LENG, Mingming; PARLAR, Mahmut.

In: Operations Research, Vol. 57, No. 1, 01.01.2009, p. 200-213.

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

TY - JOUR

T1 - Allocation of cost savings in a three-level supply chain with demand information sharing : a cooperative game approach

AU - LENG, Mingming

AU - PARLAR, Mahmut

PY - 2009/1/1

Y1 - 2009/1/1

N2 - We analyze the problem of allocating cost savings from sharing demand information in a three-level supply chain with a manufacturer, a distributor, and a retailer. To find a unique allocation scheme, we use concepts from cooperative game theory. First, we analytically compute the expected cost incurred by the manufacturer and then use simulation to obtain expected costs for the distributor and the retailer. We construct a three-person cooperative game in characteristic-function form and derive necessary conditions for the stability of each of five possible coalitions. To divide the cost savings between two members, or among three supply chain members, we use various allocation schemes. We present numerical analyses to investigate the impacts of the demand autocorrelation coefficient, ρ, and the unit holding and shortage costs on the allocation scheme.

AB - We analyze the problem of allocating cost savings from sharing demand information in a three-level supply chain with a manufacturer, a distributor, and a retailer. To find a unique allocation scheme, we use concepts from cooperative game theory. First, we analytically compute the expected cost incurred by the manufacturer and then use simulation to obtain expected costs for the distributor and the retailer. We construct a three-person cooperative game in characteristic-function form and derive necessary conditions for the stability of each of five possible coalitions. To divide the cost savings between two members, or among three supply chain members, we use various allocation schemes. We present numerical analyses to investigate the impacts of the demand autocorrelation coefficient, ρ, and the unit holding and shortage costs on the allocation scheme.

KW - Nash arbitration scheme

KW - Shapley value

KW - constrained core

KW - constrained nucleolus solution

KW - cooperative

KW - cooperative game theory

KW - games/group decisions

KW - information sharing

KW - inventory/production

KW - simulation

KW - supply chain management

UR - http://commons.ln.edu.hk/sw_master/164

U2 - 10.1287/opre.1080.0528

DO - 10.1287/opre.1080.0528

M3 - Journal Article (refereed)

VL - 57

SP - 200

EP - 213

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 1

ER -