Efficient Computation of Semivalues for Game-Theoretic Network Centrality
Authors: Piotr Szczepański, Mateusz Tarkowski, Tomasz Michalak, Paul Harrenstein, Michael Wooldridge
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We prove that all extensions that can be expressed in this framework are computable in polynomial time. |
| Researcher Affiliation | Academia | Warsaw University of Technology, Poland Mateusz K. Tarkowski University of Oxford, United Kingdom Tomasz P. Michalak1,2 and Paul Harrenstein1 and Michael Wooldridge1 1University of Oxford, United Kingdom 2University of Warsaw, Poland |
| Pseudocode | Yes | Algorithm 1: (SEMI) The semivalue-based centrality |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. There are no explicit statements about code release or links to repositories. |
| Open Datasets | No | The paper is theoretical and does not report on empirical studies using datasets, hence no information about training data is provided. |
| Dataset Splits | No | The paper describes theoretical work and does not report on empirical studies, thus no specific dataset split information for validation is provided. |
| Hardware Specification | No | The paper is theoretical and does not report on experimental implementations, therefore no specific hardware details are mentioned. |
| Software Dependencies | No | The paper describes theoretical concepts and algorithms but does not mention specific software dependencies with version numbers for experimental replication. |
| Experiment Setup | No | The paper is theoretical and does not include details on experimental setup such as hyperparameters or training configurations. |