35 citations · 200 across the 47 of their papers we have counts for
Showing 2009 · cs.CCShow all
2 papers · 2 filters
cs.CC2009★ 4 cited
The Complexity of Probabilistic Lobbying
Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau +3
We propose models for lobbying in a probabilistic environment, in which an actor (called "The Lobby") seeks to influence voters' preferences of voting for or against multiple issue…
cs.CC2009★ 2 cited
The Complexity of Computing Minimal Unidirectional Covering Sets
Dorothea Baumeister, Felix Brandt, Felix Fischer +2
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability.…