Markus Brill

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i2		Haris Aziz, Felix Brandt, Markus Brill: The Computational Complexity of Random Serial Dictatorship. CoRR abs/1304.3169 (2013)
	2012
c10		Markus Brill, Felix A. Fischer: The Price of Neutrality for the Ranked Pairs Method. AAAI 2012
c9		Haris Aziz, Paul Harrenstein, Markus Brill, Jérôme Lang, Felix A. Fischer, Hans Georg Seedig: Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592
c8		Felix Brandt, Markus Brill: Computing dominance-based solution concepts. ACM Conference on Electronic Commerce 2012: 233
i1		Haris Aziz, Markus Brill, Paul Harrenstein: Testing Substitutability of Weak Preferences. CoRR abs/1201.0432 (2012)
	2011
j3		Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011)
j2		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)
c7		Felix Brandt, Markus Brill, Hans Georg Seedig: On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. IJCAI 2011: 85-90
c6		Felix Brandt, Markus Brill: Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. TARK 2011: 136-142
	2010
c5		Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010
c4		Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein: Minimal retentive sets in tournaments. AAMAS 2010: 47-58
	2009
j1		Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann: Computing Shapley's saddles. SIGecom Exchanges 8(2): 3 (2009)
c3		Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein: Computational aspects of Shapley's saddles. AAMAS (1) 2009: 209-216
c2		Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. SAGT 2009: 238-249
c1		Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein: On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298

Coauthor Index

1	Haris Aziz	[i2] [c9] [i1]
2	Felix Brandt	[i2] [c8] [j3] [j2] [c7] [c6] [c5] [c4] [j1] [c3] [c2] [c1]
3	Felix A. Fischer	[c10] [c9] [j3] [j2] [c4] [j1] [c3] [c2] [c1]
4	Paul Harrenstein	[c9] [i1] [j2] [c4] [j1] [c3] [c1]
5	Edith Hemaspaandra (Edith Spaan)	[c5]
6	Lane A. Hemaspaandra (Lane A. Hemachandra)	[c5]
7	Jan Hoffmann 0002	[j3] [j1] [c2]
8	Jérôme Lang	[c9]
9	Hans Georg Seedig	[c9] [c7]

Last update Sat May 18 14:22:23 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page