Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games.
Oskar Skibski|Talal Rahwan|Tomasz P. Michalak|Michael J. Wooldridge
| Anthology ID: | DBLP:journals/tist/SkibskiRMW19 |
|---|---|
| Year: | 2019 |
| Venue: | ACM Transactions on Intelligent Systems and Technology (TIST) |
| Pages: | 15:1-15:25 |
| URL: | https://doi.org/10.1145/3235026 |
| DOI: | https://doi.org/10.1145/3235026 |
| DBLP: | journals/tist/SkibskiRMW19 |
| BibTeX: |
@article{skibski-2019-enumerating,
author = {Oskar Skibski and
Talal Rahwan and
Tomasz P. Michalak and
Michael J. Wooldridge},
title = {{Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games}},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {10},
number = {2},
pages = {15:1--15:25},
year = {2019},
url = {https://doi.org/10.1145/3235026},
doi = {https://doi.org/10.1145/3235026}
}