Leadership selection in an unlimited three-echelon supply chain

    Peng Jia Affiliation
    ; Hannan Amoozad Mahdiraji Affiliation
    ; Kannan Govindan Affiliation
    ; Ieva Meidutė Affiliation


Supply chain (SC) management aims to increase the overall profit through improvement of various activities and components. Many contradictions between parts and different levels of a SC have been identified in order to achieve overall objectives. Such shortfalls may result in decreased strength and competitiveness of the SC. This paper considers the main conflicts related to inventory, pricing and marketing costs in an unlimited three-echelon supply chain. Aimed at avoiding a profit decrease, the research focuses on finding an equilibrium between inventory, pricing and marketing cost of an unlimited three-echelon SC. On each level, the best leadership option with the greatest payoff is sought for between K retailer, M manufacturer and S supplier. According to Stackelberg non-cooperative game theory, each SC level can become a decision-making leader depending on the available negotiating power. Consequently, three leadership types are modelled on each level and the total SC profit is calculated and compared to ascertain the best option. The authors of the article found that transfer of leadership from a retailer to supplier results in reduction of the total profit. In addition, the research focused on the main effects of parameters used in leadership models. Finally, validation of the proposed model was examined by simulation and Arena software, which indicated that models based on a game theory were performed accurately.

Keyword : supply chain, non-cooperative game, Stackelberg game, design of experiment, simulation models

How to Cite
Jia, P., Mahdiraji, H. A., Govindan, K., & Meidutė, I. (2013). Leadership selection in an unlimited three-echelon supply chain. Journal of Business Economics and Management, 14(3), 616-637.
Published in Issue
Jun 27, 2013
Abstract Views
PDF Downloads
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.