Algorithms for computing the Shapley value of cooperative games on lattices

Abstract : We study algorithms to compute the Shapley value for a cooperative game on a lattice L Σ = (F Σ , ⊆) where F Σ is the family of closed sets given by an implicational system Σ on a set N of players. The first algorithm is based on the generation of the maximal chains of the lattice L Σ and computes the Shapley value in O(|N | 3 .|Σ|.|Ch|) time complexity using polynomial space, where Ch is the set of maximal chains of L Σ. The second algorithm proceeds by building the lattice L Σ and computes the Shapley value in O(|N | 3 .|Σ|.|F Σ |) time and space complexity. Our main contribution is to show that the Shapley value of weighted graph games on a product of chains with the same fixed length is computable in polynomial time. We do this by partitioning the set of feasible coalitions relevant to the computation of the Shapley value into equivalence classes in such a way that we need to consider only one element of each class in the computation.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01702536
Contributor : Lhouari Nourine <>
Submitted on : Tuesday, February 6, 2018 - 9:01:22 PM
Last modification on : Thursday, March 14, 2019 - 12:20:16 PM
Long-term archiving on: Tuesday, May 8, 2018 - 7:06:29 AM

File

DM-shapley.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01702536, version 1

Citation

Khaled Maafa, Lhouari Nourine, Mohammed Said Radjef. Algorithms for computing the Shapley value of cooperative games on lattices. 2018. ⟨hal-01702536⟩

Share

Metrics

Record views

150

Files downloads

846