Monografie
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
- Sprache
-
Englisch
- Anmerkungen
-
Düsseldorf, Heinrich-Heine-Universität, Diss., 2016
- Identifier
-
1093668172
Thema
Hochschulschrift
Beteiligte Personen und Organisationen
Schend, Lena
Rothe, Jörg
Niedermeier, Rolf
Rothe, Jörg
Niedermeier, Rolf
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Beteiligte
- Schend, Lena
- Rothe, Jörg
- Niedermeier, Rolf
Ähnliche Objekte (12)
A multivariate complexity analysis of voting problems
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Attackers, Packets, and Puzzles: On Denial-of-Service Prevention in Local Area Networks
Beyond Intractability: A Computational Complexity Analysis of Various Types of Influence and Stability in Cooperative Games
Majority Relations and Tournament Solutions : A Computational Study
On the Complexity of Modified Instances
Classic graph problems made temporal – a parameterized complexity analysis
Exploring parameter spaces in coping with computational intractability
A Computational Complexity Study of Various Types of Electoral Control, Cloning, and Bribery
A multivariate complexity analysis of voting problems
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Attackers, Packets, and Puzzles: On Denial-of-Service Prevention in Local Area Networks
Beyond Intractability: A Computational Complexity Analysis of Various Types of Influence and Stability in Cooperative Games
Majority Relations and Tournament Solutions : A Computational Study
On the Complexity of Modified Instances
Classic graph problems made temporal – a parameterized complexity analysis
Exploring parameter spaces in coping with computational intractability
A Computational Complexity Study of Various Types of Electoral Control, Cloning, and Bribery
A multivariate complexity analysis of voting problems
Algorithms and Complexity for Fair Division, Voting, and Peer Reviewing
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Quantum key distribution with finite resources: Improving secret key rates
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme
Attackers, Packets, and Puzzles: On Denial-of-Service Prevention in Local Area Networks
Beyond Intractability: A Computational Complexity Analysis of Various Types of Influence and Stability in Cooperative Games
Majority Relations and Tournament Solutions : A Computational Study
On the Complexity of Modified Instances
Classic graph problems made temporal – a parameterized complexity analysis
Exploring parameter spaces in coping with computational intractability