Follow
Jörg Rothe
Title
Cited by
Cited by
Year
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2892007
Llull and Copeland voting computationally resist bribery and constructive control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of Artificial Intelligence Research 35, 275-341, 2009
2592009
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of the ACM (JACM) 44 (6), 806-825, 1997
2471997
Control and Bribery in Voting.
P Faliszewski, J Rothe
Handbook of computational social choice, 146-168, 2016
2112016
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and …, 2009
1792009
Exact complexity of the winner problem for Young elections
J Rothe, H Spakowski, J Vogel
Theory of Computing Systems 36, 375-386, 2003
1532003
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing: Essays in honor of Professor Daniel J …, 2009
1352009
Economics and computation
J Rothe
Springer, 2015
1342015
The cost of stability in coalitional games
Y Bachrach, E Elkind, R Meir, D Pasechnik, M Zuckerman, J Rothe, ...
Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos …, 2009
1252009
Quantum cryptography: A survey
D Bruss, G Erdélyi, T Meyer, T Riege, J Rothe
ACM Computing Surveys (CSUR) 39 (2), 6-es, 2007
1192007
Campaigns for lazy voters: truncated ballots.
D Baumeister, P Faliszewski, J Lang, J Rothe
AAMAS, 577-584, 2012
1142012
Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control
E Hemaspaandra, LA Hemaspaandra, J Rothe
Mathematical Logic Quarterly 55 (4), 397-424, 2009
1122009
Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
G Erdélyi, M Nowak, J Rothe
Mathematical Logic Quarterly 55 (4), 425-443, 2009
1002009
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
D Baumeister, J Rothe
Information Processing Letters 112 (5), 186-190, 2012
972012
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
NT Nguyen, TT Nguyen, M Roos, J Rothe
Autonomous agents and multi-agent systems 28 (2), 256-289, 2014
882014
Verification in incomplete argumentation frameworks
D Baumeister, D Neugebauer, J Rothe, H Schadrack
Artificial Intelligence 264, 1-26, 2018
762018
Computational aspects of approval voting
D Baumeister, G Erdélyi, E Hemaspaandra, LA Hemaspaandra, J Rothe
Handbook on approval voting, 199-251, 2010
762010
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
TT Nguyen, M Roos, J Rothe
Annals of Mathematics and Artificial Intelligence 68 (1), 65-90, 2013
742013
Preference aggregation by voting
D Baumeister, J Rothe
Economics and computation: An introduction to algorithmic game theory …, 2016
722016
Fair division of indivisible goods
J Lang, J Rothe
Economics and Computation: An Introduction to Algorithmic Game Theory …, 2016
682016
The system can't perform the operation now. Try again later.
Articles 1–20