zbMATH — the first resource for mathematics

h-index manipulation by undoing merges. (English) Zbl 1394.68194
Kaminka, Gal A. (ed.) et al., ECAI 2016. 22nd European conference on artificial intelligence, The Hague, Netherlands, August 29 – September 2, 2016. Proceedings. Including proceedings of the accompanied conference on prestigious applications of intelligent systems (PAIS 2016). In 2 volumes. Amsterdam: IOS Press (ISBN 978-1-61499-671-2/pbk; 978-1-61499-672-9/ebook). Frontiers in Artificial Intelligence and Applications 285, 895-903 (2016).
Summary: The h-index is an important bibliographic measure used to assess the performance of researchers. R. van Bevern et al. [Artif. Intell. 240, 19–35 (2016; Zbl 1386.68076)] showed that, despite computational worst-case hardness results, substantial manipulation of the h-index of Google Scholar author profiles is possible by merging articles. Complementing this work, we study the opposite operation, the splitting of articles, which is arguably the more natural operation for manipulation and which is also allowed within Google Scholar. We present numerous results on computational complexity (from linear-time algorithms to parameterized computational hardness results) and empirically indicate that at least small improvements of the h-index by splitting merged articles are easily achievable.
For the entire collection see [Zbl 1352.68013].

68Q25 Analysis of algorithms and problem complexity
01A90 Bibliographic studies
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91D30 Social networks; opinion dynamics
Full Text: DOI