112 citations · 529 across the 27 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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.…
cs.CC2007★ 50 cited
Recognizing Members of the Tournament Equilibrium Set is NP-hard
Felix Brandt, Felix Fischer, Paul Harrenstein
A recurring theme in the mathematical social sciences is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's tourname…