{"title":"快速关节夏普利值","authors":"Mihail Stoian","doi":"10.1145/3555041.3589393","DOIUrl":null,"url":null,"abstract":"The Shapley value has recently drawn the attention of the data management community. Briefly, the Shapley value is a well-known numerical measure for the contribution of a player to a coalitional game. In the direct extension of Shapley axioms, the newly introduced joint Shapley value provides a measure for the average contribution of a set of players. However, due to its exponential nature, it is computationally intensive: for an explanation order of k, the original algorithm takes O(min(3^n, 2^n n^k)) time. In this work, we improve it to O(2^n nk).","PeriodicalId":161812,"journal":{"name":"Companion of the 2023 International Conference on Management of Data","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast Joint Shapley Values\",\"authors\":\"Mihail Stoian\",\"doi\":\"10.1145/3555041.3589393\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Shapley value has recently drawn the attention of the data management community. Briefly, the Shapley value is a well-known numerical measure for the contribution of a player to a coalitional game. In the direct extension of Shapley axioms, the newly introduced joint Shapley value provides a measure for the average contribution of a set of players. However, due to its exponential nature, it is computationally intensive: for an explanation order of k, the original algorithm takes O(min(3^n, 2^n n^k)) time. In this work, we improve it to O(2^n nk).\",\"PeriodicalId\":161812,\"journal\":{\"name\":\"Companion of the 2023 International Conference on Management of Data\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Companion of the 2023 International Conference on Management of Data\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3555041.3589393\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Companion of the 2023 International Conference on Management of Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3555041.3589393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Shapley value has recently drawn the attention of the data management community. Briefly, the Shapley value is a well-known numerical measure for the contribution of a player to a coalitional game. In the direct extension of Shapley axioms, the newly introduced joint Shapley value provides a measure for the average contribution of a set of players. However, due to its exponential nature, it is computationally intensive: for an explanation order of k, the original algorithm takes O(min(3^n, 2^n n^k)) time. In this work, we improve it to O(2^n nk).