EUVIMEDEUVIMED entdecken
Crossref

Complexity of Computing the Shapley Value in Partition Function Form Games

Oskar Skibski

Journal of Artificial Intelligence Research · 02.08.2023 · 77 · 1237-1274

DOI: 10.1613/jair.1.14648 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Artificial Intelligence Research, online erschienen am 02.08.2023. Verfasst von Oskar Skibski. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the complexity of computing the Shapley value in partition function form games. We focus on two representations based on marginal contribution nets (embedded MC-nets and weighted MC-nets) and five extensions of the Shapley value. Our results show that while weighted MC-nets are more concise than embedded MC-nets, they have slightly worse computational properties when it comes to computing the Shapley value: two out of five extensions can be computed in polynomial time for embedded MC-nets and only one for weighted MC-nets.

Zitieren

APA

Skibski, O. (2023). Complexity of Computing the Shapley Value in Partition Function Form Games. Journal of Artificial Intelligence Research, 77, 1237-1274. https://doi.org/10.1613/jair.1.14648

Vancouver

Skibski O. Complexity of Computing the Shapley Value in Partition Function Form Games. Journal of Artificial Intelligence Research. 2023;77:1237-1274. doi:10.1613/jair.1.14648

BibTeX
@article{Skibski2023,
  author = {Skibski, Oskar},
  title = {Complexity of Computing the Shapley Value in Partition Function Form Games},
  journal = {Journal of Artificial Intelligence Research},
  year = {2023},
  volume = {77},
  pages = {1237--1274},
  doi = {10.1613/jair.1.14648}
}
Kostenlos starten →