Hochschulschrift
Majority Relations and Tournament Solutions : A Computational Study
- Weitere Titel
-
Mehrheitsrelationen und Turnierlösungen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
München, Technische Universität München, Diss., 2015
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
München
- (wer)
-
Universitätsbibliothek der TU München
- (wann)
-
2015
- Urheber
-
Seedig, Hans Georg
- Beteiligte Personen und Organisationen
-
Brandt, Felix
Niedermeier, Rolf
- URN
-
urn:nbn:de:bvb:91-diss-20150130-1230720-1-6
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Seedig, Hans Georg
- Brandt, Felix
- Niedermeier, Rolf
- Universitätsbibliothek der TU München
Entstanden
- 2015
Ähnliche Objekte (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
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
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
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting
A refined complexity analysis of fair districting over graphs
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
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
The power of linear-time data reduction for maximum matching
On coalitional manipulation for multiwinner elections: shortlisting