Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Complexity of Computing the Shapley Value in Partition Function Form Games

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:17:22Z
dc.abstract.enWe 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.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorSkibski, Oskar
dc.date.accessioned2024-01-24T19:52:07Z
dc.date.available2024-01-24T19:52:07Z
dc.date.issued2023
dc.description.financePublikacja bezkosztowa
dc.description.volume77
dc.identifier.doi10.1613/JAIR.1.14648
dc.identifier.issn1076-9757
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/103442
dc.identifier.weblinkhttps://www.jair.org/index.php/jair/article/view/14648
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofJournal of Artificial Intelligence Research
dc.relation.pages1237-1274
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enmultiagent systems
dc.subject.engame theory
dc.titleComplexity of Computing the Shapley Value in Partition Function Form Games
dc.typeJournalArticle
dspace.entity.typePublication