Detecting and Accounting for Project Interactions in Participatory Budgeting
The core message of this article is to introduce models and algorithms for the participatory budgeting problem when projects can interact with each other, either positively or negatively. The authors propose a utility function that captures these project interactions and study the computational complexity of optimizing different aggregation criteria (sum, product, and minimum) using this utility function.
Hedonic Diversity Games: A Comprehensive Study
Hedonic diversity games complexity is comprehensively analyzed through parameterized complexity, providing insights into tractability conditions.
Collective Schedules: Axioms and Algorithms
Proposing axiomatic study and algorithms for collective scheduling problems.
Hedonic Diversity Games: A Comprehensive Study on Computational Complexity and Stability
Hedonic diversity games present a complex computational challenge with varying numbers of colors, requiring new algorithms to determine stable outcomes.
Hedonic Diversity Games: Complexity and Outcomes
The author explores the complexity of hedonic diversity games, providing insights into Nash and individually stable outcomes based on the number of colors and coalition sizes.