"Enumerating Connected Subgraphs and Computing the Myerson and Shapley ..."

Oskar Skibski et al. (2019)

> Home

Details and statistics

DOI: 10.1145/3235026

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tist/SkibskiRMW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tist/SkibskiRMW19
Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Michael J. Wooldridge:
Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games. ACM Trans. Intell. Syst. Technol. 10(2): 15:1-15:25 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.