Lena Schend

Heinrich Heine University Düsseldorf — Germany

Economics, Econometrics and Finance · Social Sciences

11h-index305citations21works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Game Theory and Voting Systems(19), Game Theory and Applications(8), Auction Theory and Applications(8), Internet Traffic Analysis and Secure E-voting(8), Electoral Systems and Political Participation(5)

Publications21 total

The possible winner with uncertain weights problem
Journal of Computer and System Sciences·2023· 6 cited
Altruistic Hedonic Games
Journal of Artificial Intelligence Research·2022· 13 citedOpen Access
Hedonic Games with Ordinal Preferences and Thresholds
Journal of Artificial Intelligence Research·2020· 21 citedOpen Access
Borda-induced hedonic games with friends, enemies, and neutral players
Mathematical Social Sciences·2018· 10 cited
Altruistic Hedonic Games
Adaptive Agents and Multi-Agents Systems·2016· 10 cited
Altruistic Hedonic Games
2016
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
2016
Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
Annals of Mathematics and Artificial Intelligence·2015· 14 cited
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds
2015· 24 citedOpen Access
Control complexity in Bucklin and fallback voting: An experimental analysis
Journal of Computer and System Sciences·2014· 27 cited
Control complexity in Bucklin and fallback voting: A theoretical analysis
Journal of Computer and System Sciences·2014· 43 cited
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting
Autonomous Agents and Multi-Agent Systems·2014· 20 cited
The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants
Frontiers in artificial intelligence and applications·2014· 16 citedOpen Access
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.
2014· 2 cited
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting
arXiv (Cornell University)·2013Open Access
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
Annals of Mathematics and Artificial Intelligence·2013· 45 cited
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
arXiv (Cornell University)·2012· 10 citedOpen Access
Control Complexity in Bucklin, Fallback, and Plurality Voting: An\n Experimental Approach
arXiv (Cornell University)·2012Open Access
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.
ISAIM·2012· 12 cited
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
Lecture notes in computer science·2012· 11 cited
page 1 of 2Next →

Frequent Co-authors

Jörg Rothe(17), Anja Rey(7), Hilmar Schadrack(5), Yannick Reisch(3), Nhan-Tam Nguyen(3), Gábor Erdélyi(2), Michael R. Fellows(2), Jérôme Lang(2), Anna Maria Kerkmann(2), Dorothea Baumeister(2), Magnus Roos(2), Lirong Xia(2), Piotr Faliszewski(2), Lisa A. Rocca Rey(2), Alessandra Wiechers(1), Lisa Rey(1), Joerg Rothe(1), Marc Neveling(1), Robin Weishaupt(1), Jörg Rothe(1)