3 citations · 6 across the 15 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.GT2025
Diversity of Structured Domains via k-Kemeny Scores
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1
In the k-Kemeny problem, we are given an ordinal election, i.e., a collection of votes ranking the candidates from best to worst, and we seek the smallest number of swaps of adjace…
cs.GT2025
Proportional Selection in Networks
Georgios Papasotiropoulos, Oskar Skibski, Piotr Skowron +1
We address the problem of selecting representative nodes from a network, aiming to achieve two objectives: identifying the most influential nodes and ensuring the selection pro…