Gábor Erdélyi

According to our database, Gábor Erdélyi authored at least 40 papers between 2005 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

The AI Liability Puzzle and A Fund-Based Work-Around.

Olivia Johanna Erdélyi, Gábor Erdélyi

J. Artif. Intell. Res., 2021

A Proposal for Amending Privacy Regulations to Tackle the Challenges Stemming from Combining Data Sets.

Gábor Erdélyi, Olivia Johanna Erdélyi, Andreas W. Kempa-Liehr

CoRR, 2021

Randomized Classifiers vs Human Decision-Makers: Trustworthy AI May Have to Act Randomly and Society Seems to Accept This.

Gábor Erdélyi, Olivia Johanna Erdélyi, Vladimir Estivill-Castro

CoRR, 2021

Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters.

Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn

Auton. Agents Multi Agent Syst., 2021

2020

Complexity of control in judgment aggregation for uniform premise-based quota rules.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker

J. Comput. Syst. Sci., 2020

The complexity of bribery and control in group identification.

Gábor Erdélyi, Christian Reger, Yongjie Yang

Auton. Agents Multi Agent Syst., 2020

Microbribery in Group Identification.

Gábor Erdélyi, Yongjie Yang

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Towards Completing the Puzzle: Solving Open Problems for Control in Elections.

Gábor Erdélyi, Christian Reger, Yongjie Yang

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2017

Computational Aspects of Nearly Single-Peaked Electorates.

Gábor Erdélyi, Martin Lackner, Andreas Pfandler

J. Artif. Intell. Res., 2017

Possible Voter Control in k-Approval and k-Veto Under Partial Information.

Gábor Erdélyi, Christian Reger

Proceedings of the Datenbanksysteme für Business, 2017

Complexity of Group Identification with Partial Information.

Gábor Erdélyi, Christian Reger, Yongjie Yang

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract).

Dirk Briskorn, Gábor Erdélyi, Christian Reger

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Possible Bribery in k-Approval and k-Veto Under Partial Information.

Gábor Erdélyi, Christian Reger

Proceedings of the Artificial Intelligence: Methodology, Systems, and Applications, 2016

Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe

Proceedings of the Economics and Computation, 2016

2015

Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Math. Soc. Sci., 2015

Control complexity in Bucklin and fallback voting: An experimental analysis.

Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend

J. Comput. Syst. Sci., 2015

Control complexity in Bucklin and fallback voting: A theoretical analysis.

Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend

J. Comput. Syst. Sci., 2015

Manipulation of k-Approval in Nearly Single-Peaked Electorates.

Gábor Erdélyi, Martin Lackner, Andreas Pfandler

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

More Natural Models of Electoral Control by Partition.

Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

The complexity of probabilistic lobbying.

Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe

Discret. Optim., 2014

Bribery and voter control under voting-rule uncertainty.

Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Computational Aspects of Manipulation and Control in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Control in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe

Proceedings of the STAIRS 2012, 2012

Manipulation under voting rule uncertainty.

Edith Elkind, Gábor Erdélyi

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Control Complexity in Bucklin and Fallback Voting

Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe

CoRR, 2011

The complexity of voter partition in Bucklin and fallback voting: solving three open problems.

Gábor Erdélyi, Lena Piras, Jörg Rothe

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation.

Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe

Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010

Bucklin Voting is Broadly Resistant to Control

Gábor Erdélyi, Lena Piras, Jörg Rothe

CoRR, 2010

Parameterized Control Complexity in Fallback Voting

Gábor Erdélyi, Michael R. Fellows

CoRR, 2010

Control Complexity in Fallback Voting

Gábor Erdélyi, Lena Piras, Jörg Rothe

CoRR, 2010

Control Complexity in Fallback Voting.

Gábor Erdélyi, Jörg Rothe

Proceedings of the Theory of Computing 2010, 2010

2009

The control complexity of sincere strategy preference based approval voting and of fallback voting, and a study of optimal lobbying and Junta distributions for SAT.

Gábor Erdélyi

PhD thesis, 2009

Generalized juntas and NP-hard sets.

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Theor. Comput. Sci., 2009

Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control.

Gábor Erdélyi, Markus Nowak, Jörg Rothe

Math. Log. Q., 2009

Frequency of correctness versus average polynomial time.

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Inf. Process. Lett., 2009

2008

Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

CoRR, 2008

Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control.

Gábor Erdélyi, Markus Nowak, Jörg Rothe

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Quantum cryptography: A survey.

Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe

ACM Comput. Surv., 2007

On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.

Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2005

Quantum Cryptography: A Survey

Gábor Erdélyi, Tobias Riege, Jörg Rothe

Electron. Colloquium Comput. Complex., 2005