Lena Schend

According to our database1, Lena Schend authored at least 19 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Hedonic Games with Ordinal Preferences and Thresholds.
J. Artif. Intell. Res., 2020

2018
Borda-induced hedonic games with friends, enemies, and neutral players.
Math. Soc. Sci., 2018

2016
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games.
PhD thesis, 2016

Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games.
Ann. Math. Artif. Intell., 2016

Altruistic Hedonic Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Control complexity in Bucklin and fallback voting: An experimental analysis.
J. Comput. Syst. Sci., 2015

Control complexity in Bucklin and fallback voting: A theoretical analysis.
J. Comput. Syst. Sci., 2015

Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting.
Auton. Agents Multi Agent Syst., 2015

Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants.
Proceedings of the STAIRS 2014, 2014

Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey.
Ann. Math. Artif. Intell., 2013

2012
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

The Possible Winner Problem with Uncertain Weights.
Proceedings of the ECAI 2012, 2012

2011
Control Complexity in Bucklin and Fallback Voting
CoRR, 2011

The complexity of voter partition in Bucklin and fallback voting: solving three open problems.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Bucklin Voting is Broadly Resistant to Control
CoRR, 2010

Control Complexity in Fallback Voting
CoRR, 2010


  Loading...