The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Felix Brandt 0001" ( http://dblp.L3S.de/Authors/Felix_Brandt_0001 )

URL (Homepage):  http://dss.in.tum.de/staff/brandt.html  Author page on DBLP  Author page in RDF  Community of Felix Brandt 0001 in ASPL-2

Publication years (Num. hits)
1999-2005 (15) 2006-2008 (18) 2009-2010 (26) 2011-2013 (25) 2014-2015 (22) 2016-2017 (20) 2018-2019 (11)
Publication types (Num. hits)
article(60) book(1) incollection(4) inproceedings(70) phdthesis(1) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 8 keywords

Results
Found 138 publication records. Showing 137 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Haris Aziz 0001, Florian Brandl, Felix Brandt 0001, Paul Harrenstein, Martin Olsen, Dominik Peters Fractional Hedonic Games. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Georg Bachmeier, Felix Brandt 0001, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig k-Majority digraphs and the hardness of voting with a constant number of voters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Johannes Hofbauer Welfare maximization entices participation. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Edith Elkind, Piotr Skowron Computational Social Choice: The First Ten Years and Beyond. Search on Bibsonomy Computing and Software Science The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Johannes Hofbauer, Martin Strobel Exploring the No-Show Paradox for Condorcet Extensions Using Ehrhart Theory and Computer Simulations. Search on Bibsonomy AAMAS The full citation details ... 2019 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Paul Harrenstein Extending tournament solutions. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Manuel Eberl, Christian Geist Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Manuel Eberl, Christian Saile, Christian Stricker 0001 The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2018 DBLP  BibTeX  RDF
1Haris Aziz 0001, Florian Brandl, Felix Brandt 0001, Markus Brill On the tradeoff between efficiency and strategyproofness. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Christian Stricker 0001 An Analytical and Experimental Comparison of Maximal Lottery Schemes. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Christian Saile, Christian Stricker 0001 Voting with Ties: Strong Impossibilities via SAT Solving. Search on Bibsonomy AAMAS The full citation details ... 2018 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill Computing Dominance-Based Solution Concepts. Search on Bibsonomy ACM Trans. Economics and Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001 Arrovian Aggregation via Pairwise Utilitarianism. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Haris Aziz 0001, Florian Brandl, Felix Brandt 0001, Paul Harrenstein, Martin Olsen, Dominik Peters Fractional Hedonic Games. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Georg Bachmeier, Felix Brandt 0001, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Felix Brandt 0001, Paul Harrenstein, Hans Georg Seedig Minimal extending sets in tournaments. Search on Bibsonomy Mathematical Social Sciences The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Christian Geist, Dominik Peters Optimal bounds for the no-show paradox via SAT solving. Search on Bibsonomy Mathematical Social Sciences The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Martin Bichler, Felix Brandt 0001, Peter Gritzmann, Rainer Kolisch Algorithmic Economics und Operations Research. Search on Bibsonomy Informatik Spektrum The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Johannes Hofbauer Random Assignment with Optional Participation. Search on Bibsonomy AAMAS The full citation details ... 2017 DBLP  BibTeX  RDF
1Felix Brandt 0001, Johannes Hofbauer, Martin Suderland Majority Graphs of Assignment Problems and Properties of Popular Random Assignments. Search on Bibsonomy AAMAS The full citation details ... 2017 DBLP  BibTeX  RDF
1Felix Brandt 0001, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia Introduction to Computational Social Choice. Search on Bibsonomy Handbook of Computational Social Choice The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia (eds.) Handbook of Computational Social Choice Search on Bibsonomy 2016 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Paul Harrenstein Tournament Solutions. Search on Bibsonomy Handbook of Computational Social Choice The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Christian Geist, Paul Harrenstein A note on the McKelvey uncovered set and Pareto optimality. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Christian Geist Finding Strategyproof Social Choice Functions via SAT Solving. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Christian Geist Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Felix Brandt 0001, Christian Geist, Dominik Peters Optimal Bounds for the No-Show Paradox via SAT Solving. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Warut Suksompong An ordinal minimax theorem. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Christian Geist Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Felix Brandt 0001, Christian Geist, Martin Strobel Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data. Search on Bibsonomy AAMAS The full citation details ... 2016 DBLP  BibTeX  RDF
1Felix Brandt 0001, Christian Geist, Dominik Peters Optimal Bounds for the No-Show Paradox via SAT Solving. Search on Bibsonomy AAMAS The full citation details ... 2016 DBLP  BibTeX  RDF
1Felix Brandt 0001 Set-monotonicity implies Kelly-strategyproofness. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Johannes Hofbauer Welfare Maximization Entices Participation. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Hans Georg Seedig Consistent Probabilistic Social Choice. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Warut Suksompong The Impossibility of Extending Random Dictatorship to Weak Preferences. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Felix Brandt 0001, Andre Dau, Hans Georg Seedig Bounds on the disparity and separation of tournament solutions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001 Computational Social Choice (Tutorial). Search on Bibsonomy STACS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Christian Geist, Johannes Hofbauer Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Johannes Hofbauer Incentives for Participation and Abstention in Probabilistic Social Choice. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Felix Brandt 0001, Guillaume Chabin, Christian Geist Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Martin Strobel Fractional Hedonic Games: Individual and Group Stability. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Felix A. Fischer, Paul Harrenstein Minimal retentive sets in tournaments. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Markus Brill, Julián Mestre Computational aspects of random serial dictatorship. Search on Bibsonomy SIGecom Exchanges The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Warut Suksompong An Ordinal Minimax Theorem. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Haris Aziz 0001, Florian Brandl, Felix Brandt 0001 On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Paul Harrenstein Extending Tournament Solutions. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Haris Aziz 0001, Florian Brandl, Felix Brandt 0001 Universal pareto dominance and welfare for plausible utility functions. Search on Bibsonomy EC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Hans Georg Seedig On the Discriminative Power of Tournament Solutions. Search on Bibsonomy OR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Paul Harrenstein Extending Tournament Solutions. Search on Bibsonomy ISAIM The full citation details ... 2014 DBLP  BibTeX  RDF
1Felix Brandt 0001, Paul Harrenstein, Hans Georg Seedig Minimal extending sets in tournaments. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Harrenstein Fractional hedonic games. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Felix Brandt 0001, Christian Geist Finding strategyproof social choice functions via SAT solving. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
1Felix Brandt 0001, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott 0001, Paul D. Seymour, Stéphan Thomassé A counterexample to a conjecture of Schwartz. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig Computing desirable partitions in additively separable hedonic games. Search on Bibsonomy Artif. Intell. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dorothea Baumeister, Felix Brandt 0001, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe The Complexity of Computing Minimal Unidirectional Covering Sets. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein On the Rate of Convergence of Fictitious Play. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Markus Brill The Computational Complexity of Random Serial Dictatorship Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Felix Brandt 0001, Hans Georg Seedig A tournament of order 24 with two disjoint TEQ-retentive sets Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Harrenstein Pareto optimality in coalition formation. Search on Bibsonomy Games and Economic Behavior The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Stursberg On Popular Random Assignments. Search on Bibsonomy SAGT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Markus Brill The Computational Complexity of Random Serial Dictatorship. Search on Bibsonomy WINE The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Markus Brill On the tradeoff between economic efficiency and strategy proofness in randomized social choice. Search on Bibsonomy AAMAS The full citation details ... 2013 DBLP  BibTeX  RDF
1Felix Brandt 0001, Paul Harrenstein, Keyvan Kardel, Hans Georg Seedig It only takes a few: on the hardness of voting with a constant number of agents. Search on Bibsonomy AAMAS The full citation details ... 2013 DBLP  BibTeX  RDF
1Felix Brandt 0001, William S. Zwicker Special Issue on Computational Foundations of Social Choice. Search on Bibsonomy Mathematical Social Sciences The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill Computing dominance-based solution concepts. Search on Bibsonomy EC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001 Minimal stable sets in tournaments. Search on Bibsonomy J. Economic Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Paul Harrenstein Set-rationalizable choice and self-stability. Search on Bibsonomy J. Economic Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 Equilibria of graphical games with symmetries. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, 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 0001, 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 0001 From Arrow's Impossibility to Schwartz's Tournament Equilibrium Set - (Invited Tutorial). Search on Bibsonomy RAMICS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Harrenstein Pareto Optimality in Coalition Formation. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, 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 0001, 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  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig Optimal Partitions in Additively Separable Hedonic Games. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001 Group-Strategyproof Irresolute Social Choice Functions. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig Stable partitions in additively separable hedonic games. Search on Bibsonomy AAMAS The full citation details ... 2011 DBLP  BibTeX  RDF
1Felix Brandt 0001 Auctions. Search on Bibsonomy Handbook of Financial Cryptography and Security The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein, Maximilian Mair A computational analysis of the tournament equilibrium set. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 On Iterated Dominance, Matrix Elimination, and Matched Paths Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001 Group-Strategyproof Irresolute Social Choice Functions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig Stable partitions in additively separable hedonic games Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig Optimal Partitions in Additively Separable Hedonic Games Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein On the Rate of Convergence of Fictitious Play. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker 10101 Executive Summary - Computational Foundations of Social Choice. Search on Bibsonomy Computational Foundations of Social Choice The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker (eds.) Computational Foundations of Social Choice, 07.03. - 12.03.2010 Search on Bibsonomy Computational Foundations of Social Choice The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker 10101 Abstracts Collection - Computational Foundations of Social Choice. Search on Bibsonomy Computational Foundations of Social Choice The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, 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
1Dorothea Baumeister, Felix Brandt 0001, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe The Complexity of Computing Minimal Unidirectional Covering Sets. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 On Iterated Dominance, Matrix Elimination, and Matched Paths. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001 Tournament Solutions and Their Applications to Multiagent Decision Making. Search on Bibsonomy MATES The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Harrenstein Monotone cooperative games and their threshold versions. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Felix A. Fischer, Paul Harrenstein Minimal retentive sets in tournaments. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein, Yoav Shoham Ranking games. Search on Bibsonomy Artif. Intell. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001 Some Remarks on Dodgson's Voting Rule. Search on Bibsonomy Math. Log. Q. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein The Computational Complexity of Choice Sets. Search on Bibsonomy Math. Log. Q. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Markus Holzer 0001 Symmetries and the complexity of pure Nash equilibrium. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, 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 0001, Paul Harrenstein Set-Rationalizable Choice and Self-Stability Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 137 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license