Hochschulschrift
Majority Relations and Tournament Solutions : A Computational Study
- Alternative title
-
Mehrheitsrelationen und Turnierlösungen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Technische Universität München, Diss., 2015
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
Universitätsbibliothek der TU München
- (when)
-
2015
- Creator
-
Seedig, Hans Georg
- Contributor
-
Brandt, Felix
Niedermeier, Rolf
- URN
-
urn:nbn:de:bvb:91-diss-20150130-1230720-1-6
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Seedig, Hans Georg
- Brandt, Felix
- Niedermeier, Rolf
- Universitätsbibliothek der TU München
Time of origin
- 2015
Other Objects (12)
Aspects of Preprocessing Applied to Combinatorial Graph Problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Equilibria in schelling games: computational hardness and robustness
Exploring parameter spaces in coping with computational intractability
Tournament solutions and majority voting : with 4 tables
The Power of Linear-Time Data Reduction for Maximum Matching
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
The power of linear-time data reduction for maximum matching
Aspects of Preprocessing Applied to Combinatorial Graph Problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Equilibria in schelling games: computational hardness and robustness
Exploring parameter spaces in coping with computational intractability
Tournament solutions and majority voting : with 4 tables
The Power of Linear-Time Data Reduction for Maximum Matching
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
The power of linear-time data reduction for maximum matching
Aspects of Preprocessing Applied to Combinatorial Graph Problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Equilibria in schelling games: computational hardness and robustness
Exploring parameter spaces in coping with computational intractability
Tournament solutions and majority voting : with 4 tables
The Power of Linear-Time Data Reduction for Maximum Matching
Modification-fair cluster editing
A refined complexity analysis of fair districting over graphs
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs