Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Rothe
Person information
- affiliation: University of Düsseldorf, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j90]Judy Goldsmith, Jörg Rothe:
Coalition formation games - preface. Ann. Math. Artif. Intell. 92(3): 535-537 (2024)- [j89]Anna Maria Kerkmann
, Simon Cramer, Jörg Rothe:
Altruism in coalition formation games. Ann. Math. Artif. Intell. 92(3): 601-629 (2024) - [j88]Joanna Kaczmarek, Jörg Rothe:
Controlling weighted voting games by deleting or adding players with or without changing the quota. Ann. Math. Artif. Intell. 92(3): 631-669 (2024) - [j87]Frank Gurski, Jörg Rothe, Robin Weishaupt:
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes. Theory Comput. Syst. 68(1): 75-102 (2024) - [c118]Joanna Kaczmarek, Jörg Rothe:
NPPP-Completeness of Control by Adding Players to Change the Penrose-Banzhaf Power Index in Weighted Voting Games. AAMAS 2024: 2318-2320 - [c117]Matthias Hoffjan, Anna Maria Kerkmann, Jörg Rothe:
Core Stability in Altruistic Coalition Formation Games. LATIN (2) 2024: 320-333 - [c116]Christian Laußmann, Jörg Rothe, Tessa Seeger:
Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. SOFSEM 2024: 355-368 - [i64]Cynthia Maushagen, David Niclaus, Paul Nüsken, Jörg Rothe, Tessa Seeger:
Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections. CoRR abs/2405.08956 (2024) - 2023
- [j86]Trung Thanh Nguyen, Jörg Rothe:
Fair and efficient allocation with few agent types, few item types, or small value levels. Artif. Intell. 314: 103820 (2023) - [j85]Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia:
The possible winner with uncertain weights problem. J. Comput. Syst. Sci. 138: 103464 (2023) - [c115]Joanna Kaczmarek, Jörg Rothe, Nimrod Talmon:
Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games. ECAI 2023: 1190-1197 - [c114]Trung Thanh Nguyen, Jörg Rothe:
Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey. IJCAI 2023: 6732-6740 - [i63]Anna Maria Kerkmann, Simon Cramer, Jörg Rothe:
Altruism in Coalition Formation Games. CoRR abs/2301.05674 (2023) - 2022
- [j84]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of shift bribery for iterative voting rules. Ann. Math. Artif. Intell. 90(10): 1017-1054 (2022) - [j83]Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers:
Altruistic Hedonic Games. J. Artif. Intell. Res. 75 (2022) - [j82]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of stability. J. Comput. Syst. Sci. 123: 103-121 (2022) - [j81]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online bribery in sequential elections. J. Comput. Syst. Sci. 127: 66-90 (2022) - [c113]Ulrik Brandes, Christian Laußmann, Jörg Rothe:
Voting for Centrality. AAMAS 2022: 1554-1556 - [c112]Anna Maria Kerkmann, Jörg Rothe:
Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games. AAMAS 2022: 1657-1659 - [c111]Simon Cramer, Anna Maria Kerkmann, Jörg Rothe:
Min-Based Altruism in Coalition Formation Games. ISAIM 2022 - [c110]Joanna Kaczmarek, Jörg Rothe:
Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota. ISAIM 2022 - [c109]Joanna Kaczmarek, Jörg Rothe:
Controlling Weighted Voting Games by Deleting or Adding Players with or Without Changing the Quota. IWOCA 2022: 355-368 - [e3]Dorothea Baumeister, Jörg Rothe:
Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings. Lecture Notes in Computer Science 13442, Springer 2022, ISBN 978-3-031-20613-9 [contents] - 2021
- [j80]Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn:
Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. 35(2): 41 (2021) - [j79]Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe:
Acceptance in incomplete argumentation frameworks. Artif. Intell. 295: 103470 (2021) - [j78]Marc Neveling, Jörg Rothe:
Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artif. Intell. 298: 103508 (2021) - [j77]Kenneth Skiba, Daniel Neugebauer, Jörg Rothe:
Complexity of Nonempty Existence Problems in Incomplete Argumentation Frameworks. IEEE Intell. Syst. 36(2): 13-24 (2021) - [j76]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Collective Acceptability in Abstract Argumentation. FLAP 8(6): 1503-1542 (2021) - [j75]Trung Thanh Nguyen, Jörg Rothe:
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. Theor. Comput. Sci. 858: 35-48 (2021) - [j74]Anna Maria Kerkmann, Nhan-Tam Nguyen, Jörg Rothe:
Local fairness in hedonic games via individual threshold coalitions. Theor. Comput. Sci. 877: 1-17 (2021) - [c108]Jörg Rothe:
Thou Shalt Love Thy Neighbor as Thyself When Thou Playest: Altruism in Game Theory. AAAI 2021: 15070-15077 - [c107]Joanna Kaczmarek, Jörg Rothe:
Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games. ADT 2021: 194-208 - [c106]Daniel Neugebauer, Jörg Rothe, Kenneth Skiba:
Complexity of Nonemptiness in Control Argumentation Frameworks. ECSQARU 2021: 117-129 - [c105]Marc Neveling, Jörg Rothe, Robin Weishaupt:
The Possible Winner Problem with Uncertain Weights Revisited. FCT 2021: 399-412 - [c104]Robin Weishaupt, Jörg Rothe:
Stability of Special Graph Classes. ICTCS 2021: 234-248 - [i62]Robin Weishaupt, Jörg Rothe:
Stability of Special Graph Classes. CoRR abs/2106.01496 (2021) - [i61]Peter Kern, Daniel Neugebauer, Jörg Rothe, René L. Schilling, Dietrich Stoyan, Robin Weishaupt:
Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory. CoRR abs/2111.05402 (2021) - [i60]Edith Elkind, Judy Goldsmith, Anja Rey, Jörg Rothe:
Coalition Formation Games (Dagstuhl Seminar 21331). Dagstuhl Reports 11(7): 1-15 (2021) - 2020
- [j73]Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe:
The price to pay for forgoing normalization in fair division of indivisible goods. Ann. Math. Artif. Intell. 88(7): 817-832 (2020) - [j72]Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. 67: 705-756 (2020) - [j71]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker:
Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. 112: 13-33 (2020) - [c103]Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe:
Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI 2020: 2942-2949 - [c102]Marc Neveling, Jörg Rothe:
The Complexity of Cloning Candidates in Multiwinner Elections. AAMAS 2020: 922-930 - [c101]Dorothea Baumeister, Tobias Hogrebe, Jörg Rothe:
Towards Reality: Smoothed Analysis in Computational Social Choice. AAMAS 2020: 1691-1695 - [c100]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. CSR 2020: 314-327 - [c99]Cynthia Maushagen, Jörg Rothe:
The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections. ECAI 2020: 163-170 - [c98]Kenneth Skiba, Daniel Neugebauer, Jörg Rothe:
Complexity of Possible and Necessary Existence Problems in Abstract Argumentation. ECAI 2020: 897-904 - [c97]Alessandra Wiechers, Jörg Rothe:
Stability in Minimization-Based Altruistic Hedonic Games. STAIRS@ECAI 2020 - [c96]Trung Thanh Nguyen, Jörg Rothe:
Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. IJCAI 2020: 290-296 - [c95]Anna Maria Kerkmann, Jörg Rothe:
Altruism in Coalition Formation Games. IJCAI 2020: 347-353 - [c94]Trung Thanh Nguyen, Jörg Rothe:
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ISAAC 2020: 14:1-14:14 - [c93]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. ISAAC 2020: 19:1-19:14 - [c92]Anna Maria Kerkmann, Jörg Rothe:
Altruism in Coalition Formation Games. ISAIM 2020 - [c91]Marc Neveling, Jörg Rothe, Roman Zorn:
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters. ISAIM 2020
2010 – 2019
- 2019
- [j70]Benno Kuckuck, Jörg Rothe:
Duplication monotonicity in the allocation of indivisible goods. AI Commun. 32(4): 253-270 (2019) - [c90]Jörg Rothe:
Borda Count in Collective Decision Making: A Summary of Recent Results. AAAI 2019: 9830-9836 - [c89]Benno Kuckuck, Jörg Rothe, Anke Weißenfeld:
Refugee Allocation in the Setting of Hedonic Games. ADT 2019: 65-80 - [c88]Pascal Lange, Jörg Rothe:
Optimizing Social Welfare in Social Networks. ADT 2019: 81-96 - [c87]Anna Maria Kerkmann, Jörg Rothe:
Stability in FEN-Hedonic Games for Single-Player Deviations. AAMAS 2019: 891-899 - [c86]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections (Extended Abstract). TARK 2019: 233-251 - [i59]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Online Bribery in Sequential Elections. CoRR abs/1906.08308 (2019) - [i58]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. CoRR abs/1910.00305 (2019) - 2018
- [j69]Tobias Heinen, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods. Auton. Agents Multi Agent Syst. 32(6): 741-778 (2018) - [j68]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Verification in incomplete argumentation frameworks. Artif. Intell. 264: 1-26 (2018) - [j67]Cynthia Maushagen, Jörg Rothe:
Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections. Ann. Math. Artif. Intell. 82(4): 219-244 (2018) - [j66]Yoram Bachrach, Edith Elkind, Enrico Malizia, Reshef Meir, Dmitrii V. Pasechnik, Jeffrey S. Rosenschein, Jörg Rothe, Michael Zuckerman:
Bounds on the Cost of Stabilizing a Cooperative Game. J. Artif. Intell. Res. 63: 987-1023 (2018) - [j65]Jörg Rothe, Hilmar Schadrack, Lena Schend:
Borda-induced hedonic games with friends, enemies, and neutral players. Math. Soc. Sci. 96: 21-36 (2018) - [j64]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-proofness of scoring allocation correspondences for indivisible goods. Soc. Choice Welf. 50(1): 101-122 (2018) - [c85]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack:
Complexity of Verification in Incomplete Argumentation Frameworks. AAAI 2018: 1753-1760 - [c84]Benno Kuckuck, Jörg Rothe:
Monotonicity, Duplication Monotonicity, and Pareto Optimality in the Scoring-Based Allocation of Indivisible Goods. AT 2018: 173-189 - [c83]Benno Kuckuck, Jörg Rothe:
Sequential Allocation Rules are Separable: Refuting a Conjecture on Scoring-Based Allocation of Indivisible Goods. AAMAS 2018: 650-658 - [c82]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Iterative Elections. AAMAS 2018: 1567-1575 - [c81]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Credulous and Skeptical Acceptance in Incomplete Argumentation Frameworks. COMMA 2018: 181-192 - [c80]Pascal Lange, Nhan-Tam Nguyen, Jörg Rothe:
The Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods. ISAIM 2018 - [c79]Cynthia Maushagen, Marc Neveling, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Shift Bribery in Hare, Coombs, Baldwin, and Nanson Elections. ISAIM 2018 - 2017
- [j63]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine:
Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. 31(3): 628-655 (2017) - [j62]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online voter control in sequential elections. Auton. Agents Multi Agent Syst. 31(5): 1055-1076 (2017) - [j61]Anja Rey, Jörg Rothe, Adrian Marple:
Path-Disruption Games: Bribery and a Probabilistic Model. Theory Comput. Syst. 60(2): 222-252 (2017) - [j60]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of controlling candidate-sequential elections. Theor. Comput. Sci. 678: 14-21 (2017) - [c78]Marc Neveling, Jörg Rothe:
Solving Seven Open Problems of Offline and Online Control in Borda Elections. AAAI 2017: 3029-3035 - [c77]Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods. AAMAS 2017: 262-271 - [c76]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols. AAMAS 2017: 615-623 - [c75]Marc Neveling, Jörg Rothe:
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases. ICTCS/CILC 2017: 138-149 - [e2]Jörg Rothe:
Algorithmic Decision Theory - 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25-27, 2017, Proceedings. Lecture Notes in Computer Science 10576, Springer 2017, ISBN 978-3-319-67503-9 [contents] - 2016
- [j59]Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
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. 77(3-4): 317-333 (2016) - [c74]Nhan-Tam Nguyen, Jörg Rothe:
Local Fairness in Hedonic Games via Individual Threshold Coalitions. AAMAS 2016: 232-241 - [c73]Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend:
Altruistic Hedonic Games. AAMAS 2016: 251-259 - [c72]Anja Rey, Jörg Rothe:
Structural Control in Weighted Voting Games: (Extended Abstract). AAMAS 2016: 1371-1372 - [c71]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partitioning Veto and Maximin Elections and of Control by Adding Candidates to Plurality Elections. ECAI 2016: 277-285 - [c70]Cynthia Maushagen, Jörg Rothe:
Complexity of Control by Partitioning Veto and Maximin Elections. ISAIM 2016 - [c69]Anja Rey, Jörg Rothe:
Structural Control in Weighted Voting Games. MFCS 2016: 80:1-80:15 - [c68]Victor Persien, Anja Rey, Jörg Rothe:
Cost of Stability and Least Core in Path-Disruption Games. STAIRS 2016: 99-110 - [p8]Jörg Rothe:
Playing, Voting, and Dividing. Economics and Computation 2016: 1-37 - [p7]Piotr Faliszewski, Irene Rothe, Jörg Rothe:
Noncooperative Game Theory. Economics and Computation 2016: 41-134 - [p6]Edith Elkind, Jörg Rothe:
Cooperative Game Theory. Economics and Computation 2016: 135-193 - [p5]Dorothea Baumeister, Jörg Rothe:
Preference Aggregation by Voting. Economics and Computation 2016: 197-325 - [p4]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Complexity of Manipulative Actions in Single-Peaked Societies. Economics and Computation 2016: 327-360 - [p3]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
Judgment Aggregation. Economics and Computation 2016: 361-391 - [p2]Claudia Lindner, Jörg Rothe:
Cake-Cutting: Fair Division of Divisible Goods. Economics and Computation 2016: 395-491 - [p1]Jérôme Lang, Jörg Rothe:
Fair Division of Indivisible Goods. Economics and Computation 2016: 493-550 - [e1]Jörg Rothe:
Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer texts in business and economics, Springer 2016, ISBN 978-3-662-47903-2 [contents] - [r1]Piotr Faliszewski, Jörg Rothe:
Control and Bribery in Voting. Handbook of Computational Social Choice 2016: 146-168 - 2015
- [j58]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. 29(6): 1091-1124 (2015) - [j57]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4): 632-660 (2015) - [j56]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4): 661-670 (2015) - [j55]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. 76: 19-30 (2015) - [c67]Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe:
Verification in Attack-Incomplete Argumentation Frameworks. ADT 2015: 341-358 - [c66]Dorothea Baumeister, Jörg Rothe, Hilmar Schadrack:
Verification in Argument-Incomplete Argumentation Frameworks. ADT 2015: 359-376 - [c65]Dorothea Baumeister, Jörg Rothe, Ann-Kathrin Selker:
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types. ADT 2015: 432-448 - [c64]Tobias Heinen, Nhan-Tam Nguyen, Jörg Rothe:
Fairness and Rank-Weighted Utilitarianism in Resource Allocation. ADT 2015: 521-536 - [c63]Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS 2015: 1229-1237 - [c62]Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe:
Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods. IJCAI 2015: 1127-1133 - 2014
- [j54]Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agents Multi Agent Syst. 28(2): 256-289 (2014) - [j53]Trung Thanh Nguyen, Jörg Rothe:
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discret. Appl. Math. 179: 54-68 (2014) - [j52]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe:
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014) - [j51]Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time. J. Artif. Intell. Res. 50: 573-601 (2014) - [j50]Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The complexity of online manipulation of sequential elections. J. Comput. Syst. Sci. 80(4): 697-710 (2014) - [c61]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014: 1357-1358 - [c60]Adrian Marple, Anja Rey, Jörg Rothe:
Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy. AAMAS 2014: 1375-1376 - [c59]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Scoring Rules for the Allocation of Indivisible Goods. ECAI 2014: 75-80 - [c58]