Linearly representable games and pseudo-polynomial calculation of the Shapley value
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915008903905280 |
|---|---|
| author | Illés, Ferenc |
| author_facet | Illés, Ferenc |
| contents | We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that the Shapley value calculation is pseudo-polynomial for linearly representable games. This is a generalization of many classical and recent results in the literature. Our method naturally turns into a strictly polynomial algorithm when the parameters are polynomial in the number of players. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_12324 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Linearly representable games and pseudo-polynomial calculation of the Shapley value Illés, Ferenc Computer Science and Game Theory We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that the Shapley value calculation is pseudo-polynomial for linearly representable games. This is a generalization of many classical and recent results in the literature. Our method naturally turns into a strictly polynomial algorithm when the parameters are polynomial in the number of players. |
| title | Linearly representable games and pseudo-polynomial calculation of the Shapley value |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2205.12324 |