2 citations · 2 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2014
Solving Hard Control Problems in Voting Systems via Integer Programming
Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear progra…
cs.GT2013★ 2 cited
Relation-algebraic and Tool-supported Control of Condorcet Voting
Rudolf Berghammer, Henning Schnoor
We present a relation-algebraic model of Condorcet voting and, based on it, relation-algebraic solutions of the constructive control problem via the removal of voters. We consider…