Search Results for author:
Found 3 papers, 0 papers with code
Fine-Grained Complexity and Algorithms for the Schulze Voting Method
We prove a similar connection between the so called Dominating Pairs problem and the problem of finding a winner in the Schulze method.
Participatory Budgeting with Project Groups
We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several groupings of the projects, each group with its own budget limit.
Approximation and Parameterized Complexity of Minimax Approval Voting
Motivated by this, we then show a parameterized approximation scheme, running in time $\mathcal{O}^\star(\left({3}/{\epsilon}\right)^{2d})$, which is essentially tight assuming ETH.
