17 papers · 1 filter
Algorithms for Candidate Control in Greedy Participatory Budgeting Rules
Å imon Schierreich, Krzysztof Sornat
We study the problem of candidate control in participatory budgeting elections. Our focus is on two prominent sequential welfare-based rules---GreedyAV and GreedyCost---which are w…
Network Allocation Games with Anonymous Preferences
Argyrios Deligkas, Eduard Eiben, Å imon Schierreich +1
We study network allocation games in which a set of agents must be allocated to (a subset of) the vertices of a graph topology. The agents are anonymous and strategic: Each of them…
An Entropy Potential for Type-Composition Games
Morteza Alimi, Merlin de la Haye, Pascal Lenzner +3
Potential functions are a key tool in theoretical computer science with applications ranging from the runtime analysis of algorithms and data structures, through the analysis of th…
Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
KatarÃna Cechlárová, Jörg Rothe, Å imon Schierreich +1
We study the Possible President problem and the Necessary President problem for Schulze voting, a rule that, due to its many desirable axiomatic properties, is popular in practice.…
Individual Rationality in Constrained Hedonic Games: Additively Separable and Fractional Preferences
Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos +1
Hedonic games are an archetypal problem in coalition formation, where a set of selfish agents want to partition themselves into stable coalitions. In this work, we focus on two nat…
Optimal Path Planning in Hostile Environments
Andrzej Kaczmarczyk, Å imon Schierreich, Nicholas Axel Tanujaya +1
Coordinating agents through hazardous environments, such as aid-delivering drones navigating conflict zones or field robots traversing deployment areas filled with obstacles, poses…