 | 2012 |
|---|
| 11 |       | Haris Aziz,
Markus Brill,
Paul Harrenstein:
Testing Substitutability of Weak Preferences
CoRR abs/1201.0432: (2012) |
| 2011 |
|---|
| 10 | | Felix Brandt,
Markus Brill,
Hans Georg Seedig:
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.
IJCAI 2011: 85-90 |
| 9 | | Felix Brandt,
Markus Brill:
Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.
TARK 2011: 136-142 |
| 8 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Jan Hoffmann:
The Computational Complexity of Weak Saddles.
Theory Comput. Syst. 49(1): 139-161 (2011) |
| 7 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Theory Comput. Syst. 49(1): 162-181 (2011) |
| 2010 |
|---|
| 6 | | Felix Brandt,
Markus Brill,
Edith Hemaspaandra,
Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
AAAI 2010 |
| 5 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Paul Harrenstein:
Minimal retentive sets in tournaments.
AAMAS 2010: 47-58 |
| 2009 |
|---|
| 4 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Paul Harrenstein:
Computational aspects of Shapley's saddles.
AAMAS (1) 2009: 209-216 |
| 3 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Jan Hoffmann:
The Computational Complexity of Weak Saddles.
SAGT 2009: 238-249 |
| 2 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
SAGT 2009: 287-298 |
| 1 | | Felix Brandt,
Markus Brill,
Felix A. Fischer,
Paul Harrenstein,
Jan Hoffmann:
Computing Shapley's saddles.
SIGecom Exchanges 8(2): 3 (2009) |
Data released under the ODC-BY 1.0 license — See also our legal information page