Flow-Based Network Creation Games
Authors: Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | For this novel type of NCG we prove that pure Nash equilibria exist, we give a simple algorithm for computing optimal networks, we show that the Price of Stability is 1 and we prove an (almost) tight bound of 2 on the Price of Anarchy. Last but not least, we show that our models do not admit a potential function. |
| Researcher Affiliation | Academia | Hagen Echzell , Tobias Friedrich , Pascal Lenzner and Anna Melnichenko Hasso Plattner Institute, University of Potsdam, Germany |
| Pseudocode | Yes | Algorithm 1: Algorithm for computing the OPT |
| Open Source Code | No | The paper does not provide any explicit statement about making source code available or include links to code repositories. |
| Open Datasets | No | This paper is theoretical and does not use datasets for empirical studies. |
| Dataset Splits | No | This paper is theoretical and does not involve empirical validation with dataset splits. |
| Hardware Specification | No | This paper is theoretical and does not report on computational experiments that would require hardware specifications. |
| Software Dependencies | No | This paper is theoretical and does not mention specific software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | This paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |