Proceedings

Proportional Selection in Networks

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 3514-3522.

https://doi.org/10.24963/ijcai.2026/391

Abstract

We address the problem of selecting k representative nodes from a network, aiming to simultaneously achieve two objectives: identifying the most influential nodes and ensuring that the selection proportionally reflects the diversity within the network. We propose a general approach to accomplish this by combining ideas from network science and computational social choice. Notably, our algorithms depend only on the connections between nodes and do not utilize any additional information that would explicitly identify groups of nodes. We analyze them theoretically, and demonstrate their effectiveness through a series of experiments.

Georgios Papasotiropoulos, Oskar Skibski, Piotr Skowron, and Tomasz Wąs. 2026. Proportional Selection in Networks. In Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26. IJCAI, 3514–3522. https://doi.org/10.24963/ijcai.2026/391
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards