Hochschulschrift
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
- Weitere Titel
-
Algorithmische Aspekte der Ressourcenallokation und Komiteewahlen: Theorie und Experimente
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Dissertation, 2020
- Erschienen in
-
Foundations of computing ; 15
- Klassifikation
-
Informatik
- Schlagwort
-
Voting
Resource allocation
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Universitätsverlag der TU Berlin
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
-
Niedermeier, Rolf
Bouveret, Sylvain
Brandt, Felix
- DOI
-
10.14279/depositonce-12056
- Handle
-
11303/13264
- URN
-
urn:nbn:de:101:1-2021121506230046026841
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:23 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
- Kaczmarczyk, Andrzej
- Niedermeier, Rolf
- Bouveret, Sylvain
- Brandt, Felix
- Universitätsverlag der TU Berlin
Entstanden
- 2021
Ähnliche Objekte (12)
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic and structural aspects of temporal graphs
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
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
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic and structural aspects of temporal graphs
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
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
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic and structural aspects of temporal graphs
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
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