Gábor Erdélyi

Publication Activity (10 Years)

Years Active: 2005-2021
Publications (10 Years): 21

Top Venues

AAMAS

CoRR

ADT

J. Comput. Syst. Sci.

Heinrich Heine University Düsseldorf (PHD)

Education History

Heinrich Heine University Düsseldorf

PHD

Publications

Gábor Erdélyi, Olivia Johanna Erdélyi, Andreas W. Kempa-Liehr
A Proposal for Amending Privacy Regulations to Tackle the Challenges Stemming from Combining Data Sets. CoRR (2021)
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) (2021)
Gábor Erdélyi, Olivia Johanna Erdélyi, Vladimir Estivill-Castro
Randomized Classifiers vs Human Decision-Makers: Trustworthy AI May Have to Act Randomly and Society Seems to Accept This. CoRR (2021)
Olivia Johanna Erdélyi, Gábor Erdélyi
The AI Liability Puzzle and A Fund-Based Work-Around. J. Artif. Intell. Res. 70 (2021)
Olivia Johanna Erdélyi, Gábor Erdélyi
The AI Liability Puzzle and a Fund-Based Work-Around. AIES (2020)
Gábor Erdélyi, Christian Reger, Yongjie Yang
The complexity of bribery and control in group identification. Auton. Agents Multi Agent Syst. 34 (1) (2020)
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 (2020)
Gábor Erdélyi, Yongjie Yang
Microbribery in Group Identification. AAMAS (2020)
Olivia Johanna Erdélyi, Gábor Erdélyi
The AI Liability Puzzle and A Fund-Based Work-Around. CoRR (2019)
Gábor Erdélyi, Christian Reger, Yongjie Yang
Towards Completing the Puzzle: Solving Open Problems for Control in Elections. AAMAS (2019)
Gábor Erdélyi, Christian Reger, Yongjie Yang
Complexity of Group Identification with Partial Information. ADT (2017)
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Computational Aspects of Nearly Single-Peaked Electorates. J. Artif. Intell. Res. 58 (2017)
Gábor Erdélyi, Christian Reger, Yongjie Yang
The Complexity of Bribery and Control in Group Identification. AAMAS (2017)
Gábor Erdélyi, Christian Reger
Possible Voter Control in k-Approval and k-Veto Under Partial Information. BTW (Workshops) (2017)
Gábor Erdélyi, Christian Reger
Possible Bribery in k-Approval and k-Veto Under Partial Information. AIMSA (2016)
Dirk Briskorn, Gábor Erdélyi, Christian Reger
Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract). AAMAS (2016)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition. ADT (2015)
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) (2015)
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 (2015)
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Manipulation of k-Approval in Nearly Single-Peaked Electorates. ADT (2015)
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) (2015)
Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe
The complexity of probabilistic lobbying. Discret. Optim. 11 (2014)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
Bribery and voter control under voting-rule uncertainty. AAMAS (2014)
Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition. CoRR (2014)
Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT (2013)
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Computational Aspects of Nearly Single-Peaked Electorates. AAAI (2013)
Edith Elkind, Gábor Erdélyi
Manipulation under voting rule uncertainty. AAMAS (2012)
Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
Control in Judgment Aggregation. STAIRS (2012)
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Computational Aspects of Nearly Single-Peaked Electorates CoRR (2012)
Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT (2011)
Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe
Control Complexity in Bucklin and Fallback Voting CoRR (2011)
Gábor Erdélyi, Lena Piras, Jörg Rothe
The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS (2011)
Gábor Erdélyi, Michael R. Fellows
Parameterized Control Complexity in Fallback Voting CoRR (2010)
Gábor Erdélyi, Lena Piras, Jörg Rothe
Bucklin Voting is Broadly Resistant to Control CoRR (2010)
Gábor Erdélyi, Lena Piras, Jörg Rothe
Control Complexity in Fallback Voting CoRR (2010)
Gábor Erdélyi, Jörg Rothe
Control Complexity in Fallback Voting. CATS (2010)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109 (16) (2009)
Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
The Complexity of Probabilistic Lobbying CoRR (2009)
Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
The Complexity of Probabilistic Lobbying. ADT (2009)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410 (38-40) (2009)
Gábor Erdélyi, Markus Nowak, Jörg Rothe
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. Math. Log. Q. 55 (4) (2009)
Gábor Erdélyi, Markus Nowak, Jörg Rothe
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. MFCS (2008)
Gábor Erdélyi, Markus Nowak, Jörg Rothe
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control CoRR (2008)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas CoRR (2008)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time CoRR (2007)
Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT (2007)
Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe
Quantum cryptography: A survey. ACM Comput. Surv. 39 (2) (2007)
Gábor Erdélyi, Tobias Riege, Jörg Rothe
Quantum Cryptography: A Survey Electron. Colloquium Comput. Complex. (146) (2005)

Gábor Erdélyi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gábor Erdélyi