Voting is a core element of social choice theory and a subarea of computational social choice. The goal is to rank (or rate) candidates according to voters’ preferences, and to eventually select the winner(s) of the election. In multiwinner voting, the same applies to sets of candidates and winning committee(s). The intuition is therefore quite similar to centrality in networks, where the goal is to rate (or rank) nodes—or groups of nodes—according to their structural positions. We establish correspondences between these two research fields by deriving preference rankings from network relations, and adapting single- and multiwinner voting rules to identify the most central (groups of) nodes. The transfer of reasonable and desirable properties and axioms from social choice theory to network science opens up the possibility to study novel aspects of centrality, and leads to the definition of voting-based centrality measures.
Laußmann, Christian, Volz, Katharina, Brandes, Ulrik et al. Voting for centrality. // Computational and Mathematical Organization Theory. – 2026. – DOI: 10.1007/s10588-026-09444-6. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10588-026-09444-6
Laußmann, Christian, Volz, Katharina, Brandes, Ulrik, Rothe, & Jörg (2026). Voting for centrality. Computational and Mathematical Organization Theory. https://doi.org/10.1007/s10588-026-09444-6
Laußmann, et al. “Voting for centrality.” Computational and Mathematical Organization Theory, 2026. doi:10.1007/s10588-026-09444-6.
@article{Laumann2026,
title = {Voting for centrality},
author = {Laußmann and Christian and Volz and Katharina and Brandes and Ulrik and Rothe and Jörg},
journal = {Computational and Mathematical Organization Theory},
year = {2026},
doi = {10.1007/s10588-026-09444-6},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10588-026-09444-6}
}
Multilayer supply chains are complex adaptive organizations in which disaster-induced failures propagate across material, transportation, information, and inventory functions. This study develops a computational framework that couples...
Platform owners that build their own technology must decide whether rising, AI-driven complexity calls for coarser (more integrated) or finer (more decoupled) module boundaries. We develop a computational model in which a platform...
Artificial intelligence (AI) automation challenges the assumption that careers are shaped mainly by individual choices, and directs attention to the interplay of individual, organisational and environmental conditions emphasised by the...
Graph substructures play a critical role in defining network characteristics, making it essential for graph generators to accurately replicate these substructures to produce realistic graphs. However, the increasing rate of data in...
Bipartite networks represent interactions between two different types of vertices, such as users and items, authors and papers, documents and words, buyers and suppliers, or senders and receivers. Most bipartite community detection...