Axiomatic Characterization of Game-Theoretic Network Centralities
Authors: Oskar Skibski, Tomasz Michalak, Talal Rahwan
AAAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we answer this question by providing the first axiomatic characterization of game-theoretic centralities. Specifically, we show that every centrality can be obtained following the game-theoretic approach, and show that two natural classes of game-theoretic centrality can be characterized by two intuitive properties pertaining to Myerson s notion of Fairness. |
| Researcher Affiliation | Academia | Oskar Skibski,1 Tomasz P. Michalak,1,2 Talal Rahwan3 1Institute of Informatics, University of Warsaw, Poland 2Department of Computer Science, University of Oxford, UK 3Masdar Institute of Science and Technology, United Arab Emirates |
| Pseudocode | No | The paper focuses on theoretical characterizations and proofs; it does not contain any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention or provide access to any open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets, thus no information about public dataset availability for training is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments or dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper is theoretical and does not describe any computational experiments that would require hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not describe any software implementation or dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not include details about an experimental setup, hyperparameters, or training configurations. |