Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games

Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge. Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games. ACM TIST, 10(2), 2019. [doi]

@article{SkibskiRMW19,
  title = {Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games},
  author = {Oskar Skibski and Talal Rahwan and Tomasz P. Michalak and Michael Wooldridge},
  year = {2019},
  url = {https://dl.acm.org/citation.cfm?id=3235026},
  researchr = {https://researchr.org/publication/SkibskiRMW19},
  cites = {0},
  citedby = {0},
  journal = {ACM TIST},
  volume = {10},
  number = {2},
}