Efficient computation of the Shapley value for large-scale linear production games



Le, Phuoc Hoang, Nguyen, Tri-Dung and Bektas, Tolga ORCID: 0000-0003-0634-144X
(2020) Efficient computation of the Shapley value for large-scale linear production games. ANNALS OF OPERATIONS RESEARCH, 287 (2). pp. 761-781.

[img] Text
LPGames.pdf - Author Accepted Manuscript

Download (497kB)

Abstract

The linear production game is concerned with allocating the total payoff of an enterprise among the owners of the resources in a fair way. With cooperative game theory providing a mathematical framework for sharing the benefit of the cooperation, the Shapley value is one of the widely used solution concepts as a fair measurement in this area. Finding the exact Shapley value for linear production games is, however, challenging when the number of players exceeds 30. This paper describes the use of linear programming sensitivity analysis for a more efficient computation of the Shapley value. The paper also proposes a stratified sampling technique to estimate the Shapley value for large-scale linear production games. Computational results show the effectiveness of the proposed methods compared to others.

Item Type: Article
Uncontrolled Keywords: Cooperative games, Linear production game, Payoff allocation, Shapley value, Fairness
Depositing User: Symplectic Admin
Date Deposited: 02 Oct 2018 13:30
Last Modified: 19 Jan 2023 01:15
DOI: 10.1007/s10479-018-3047-0
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3026976