Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Markus Brill" ( http://dblp.L3S.de/Authors/Markus_Brill )

  Author page on DBLP  Author page in RDF  Community of Markus Brill in ASPL-2

Publication years (Num. hits)
2009 (4) 2010 (2) 2011 (4) 2012 (1)
Publication types (Num. hits)
article(4) inproceedings(7)
Venues (Conferences, Journals, ...)
AAMAS(2) SAGT(2) Theory Comput. Syst.(2) AAAI(1) CoRR(1) IJCAI(1) SIGecom Exchanges(1) TARK(1)
Authors
Markus Brill(11) Felix Brandt(10) Felix A. Fischer(7) Paul Harrenstein(6) Jan Hoffmann 0002(3) Edith Hemaspaandra(1) Hans Georg Seedig(1) Haris Aziz(1) Lane A. Hemaspaandra(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords
Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Haris Aziz, Markus Brill, Paul Harrenstein Testing Substitutability of Weak Preferences Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 The Computational Complexity of Weak Saddles. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Hans Georg Seedig On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Felix Brandt, Markus Brill Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. Search on Bibsonomy TARK The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein Minimal retentive sets in tournaments. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Search on Bibsonomy AAAI The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann 0002 Computing Shapley's saddles. Search on Bibsonomy SIGecom Exchanges The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 The Computational Complexity of Weak Saddles. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein Computational aspects of Shapley's saddles. Search on Bibsonomy AAMAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Shapley's saddles, game theory, solution concepts
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.