22 citations · 33 across the 3 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2017
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters
Georg Bachmeier, Felix Brandt, Christian Geist +4
Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. How…
cs.GT2015★ 2 cited
On the Susceptibility of the Deferred Acceptance Algorithm
Haris Aziz, Hans Georg Seedig, Jana Karina von Wedel
The Deferred Acceptance Algorithm (DAA) is the most widely accepted and used algorithm to match students, workers, or residents to colleges, firms or hospitals respectively. In thi…