1 citations · 1 across the 5 of their papers we have counts for
8 papers
Independence of Approximate Clones
Théo Delemazure
In an ordinal election, two candidates are said to be perfect clones if every voter ranks them adjacently. The independence of clones axiom then states that removing one of the two…
Reallocating Wasted Votes in Proportional Parliamentary Elections with Thresholds
Théo Delemazure, Rupert Freeman, Jérôme Lang +2
In many proportional parliamentary elections, electoral thresholds (typically 3-5%) are used to promote stability and governability by preventing the election of parties with very…
Selecting the Most Conflicting Pair of Candidates
Théo Delemazure, Łukasz Janeczko, Andrzej Kaczmarczyk +1
We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences.…
Comparing Ways of Obtaining Candidate Orderings from Approval Ballots
Théo Delemazure, Chris Dong, Dominik Peters +1
To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using…
Generalizing Instant Runoff Voting to Allow Indifferences
Théo Delemazure, Dominik Peters
Instant Runoff Voting (IRV) is used in elections for many political offices around the world. It allows voters to specify their preferences among candidates as a ranking. We identi…
Measuring a Priori Voting Power -- Taking Delegations Seriously
Rachael Colley, Théo Delemazure, Hugo Gilbert
We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our pow…
Approval with Runoff
Théo Delemazure, Jérôme Lang, Jean-François Laslier +1
We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With appro…
Algorithmic Techniques for Necessary and Possible Winners
Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld +3
We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show h…