# Gábor Erdélyi

According to our database

Collaborative distances:

^{1}, Gábor Erdélyi authored at least 40 papers between 2005 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2021

J. Artif. Intell. Res., 2021

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

CoRR, 2021

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

CoRR, 2021

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

Auton. Agents Multi Agent Syst., 2021

2020

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

J. Comput. Syst. Sci., 2020

Auton. Agents Multi Agent Syst., 2020

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

2019

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

2017

J. Artif. Intell. Res., 2017

Proceedings of the Datenbanksysteme für Business, 2017

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

2016

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

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

Proceedings of the Economics and Computation, 2016

2015

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

Math. Soc. Sci., 2015

J. Comput. Syst. Sci., 2015

J. Comput. Syst. Sci., 2015

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

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

2014

Discret. Optim., 2014

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

2013

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

2012

Proceedings of the STAIRS 2012, 2012

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

2011

CoRR, 2011

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

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.

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

2010

CoRR, 2010

CoRR, 2010

CoRR, 2010

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.

PhD thesis, 2009

Theor. Comput. Sci., 2009

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

Math. Log. Q., 2009

Inf. Process. Lett., 2009

2008

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

CoRR, 2008

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

ACM Comput. Surv., 2007

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

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

2005

Electron. Colloquium Comput. Complex., 2005