Gábor Erdélyi

51 papers A* 1A 7B 2C 1Misc 1Journal 28Unranked 9

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	AI regulation: still a to-do item on New Zealand's political agenda. Discov. Artif. Intell. Olivia Johanna Erdélyi, Gábor Erdélyi
2021	J	`jnl`	A Proposal for Amending Privacy Regulations to Tackle the Challenges Stemming from Combining Data Sets. CoRR Gábor Erdélyi, Olivia Johanna Erdélyi, Andreas W. Kempa-Liehr
2021	J	`jnl`	Randomized Classifiers vs Human Decision-Makers: Trustworthy AI May Have to Act Randomly and Society Seems to Accept This. CoRR Gábor Erdélyi, Olivia Johanna Erdélyi, Vladimir Estivill-Castro
2021	J	`jnl`	The AI Liability Puzzle and A Fund-Based Work-Around. J. Artif. Intell. Res. Olivia Johanna Erdélyi, Gábor Erdélyi
2021	J	`jnl`	Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi Agent Syst. Gábor Erdélyi, Marc Neveling, Christian Reger, Jörg Rothe, Yongjie Yang, Roman Zorn
2020	J	`jnl`	Complexity of control in judgment aggregation for uniform premise-based quota rules. J. Comput. Syst. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe, Ann-Kathrin Selker
2020	A	`conf`	Microbribery in Group Identification. AAMAS Gábor Erdélyi, Yongjie Yang
2020	C	`conf`	The AI Liability Puzzle and a Fund-Based Work-Around. AIES Olivia Johanna Erdélyi, Gábor Erdélyi
2020	J	`jnl`	The complexity of bribery and control in group identification. Auton. Agents Multi Agent Syst. Gábor Erdélyi, Christian Reger, Yongjie Yang
2019	J	`jnl`	The AI Liability Puzzle and A Fund-Based Work-Around. CoRR Olivia Johanna Erdélyi, Gábor Erdélyi
2019	A	`conf`	Towards Completing the Puzzle: Solving Open Problems for Control in Elections. AAMAS Gábor Erdélyi, Christian Reger, Yongjie Yang
2017	—	`conf`	Complexity of Group Identification with Partial Information. ADT Gábor Erdélyi, Christian Reger, Yongjie Yang
2017	J	`jnl`	Computational Aspects of Nearly Single-Peaked Electorates. J. Artif. Intell. Res. Gábor Erdélyi, Martin Lackner, Andreas Pfandler
2017	—	`conf`	Possible Voter Control in k-Approval and k-Veto Under Partial Information. BTW (Workshops) Gábor Erdélyi, Christian Reger
2017	A	`conf`	The Complexity of Bribery and Control in Group Identification. AAMAS Gábor Erdélyi, Christian Reger, Yongjie Yang
2016	A	`conf`	Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract). AAMAS Dirk Briskorn, Gábor Erdélyi, Christian Reger
2016	—	`ch.`	Judgment Aggregation. Economics and Computation Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2016	Misc	`conf`	Possible Bribery in k-Approval and k-Veto Under Partial Information. AIMSA Gábor Erdélyi, Christian Reger
2015	J	`jnl`	Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	—	`conf`	Manipulation of k-Approval in Nearly Single-Peaked Electorates. ADT Gábor Erdélyi, Martin Lackner, Andreas Pfandler
2015	—	`conf`	More Natural Models of Electoral Control by Partition. ADT Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	A	`conf`	Bribery and voter control under voting-rule uncertainty. AAMAS Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	More Natural Models of Electoral Control by Partition. CoRR Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
2014	J	`jnl`	The complexity of probabilistic lobbying. Discret. Optim. Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe
2013	—	`conf`	Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2013	A*	`conf`	Computational Aspects of Nearly Single-Peaked Electorates. AAAI Gábor Erdélyi, Martin Lackner, Andreas Pfandler
2012	J	`jnl`	Computational Aspects of Nearly Single-Peaked Electorates CoRR Gábor Erdélyi, Martin Lackner, Andreas Pfandler
2012	—	`conf`	Control in Judgment Aggregation. STAIRS Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe
2012	A	`conf`	Manipulation under voting rule uncertainty. AAMAS Edith Elkind, Gábor Erdélyi
2011	J	`jnl`	Control Complexity in Bucklin and Fallback Voting CoRR Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe
2011	—	`conf`	How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. ADT Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe
2011	A	`conf`	The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS Gábor Erdélyi, Lena Piras, Jörg Rothe
2010	J	`jnl`	Bucklin Voting is Broadly Resistant to Control CoRR Gábor Erdélyi, Lena Piras, Jörg Rothe
2010	J	`jnl`	Control Complexity in Fallback Voting CoRR Gábor Erdélyi, Lena Piras, Jörg Rothe
2010	—	`conf`	Control Complexity in Fallback Voting. CATS Gábor Erdélyi, Jörg Rothe
2010	J	`jnl`	Parameterized Control Complexity in Fallback Voting CoRR Gábor Erdélyi, Michael R. Fellows
2009	J	`jnl`	Frequency of correctness versus average polynomial time. Inf. Process. Lett. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Generalized juntas and NP-hard sets. Theor. Comput. Sci. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2009	J	`jnl`	Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. Math. Log. Q. Gábor Erdélyi, Markus Nowak, Jörg Rothe
2009	J	`jnl`	The Complexity of Probabilistic Lobbying CoRR Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	—	`conf`	The Complexity of Probabilistic Lobbying. ADT Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
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
2008	J	`jnl`	Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2008	B	`conf`	Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. MFCS Gábor Erdélyi, Markus Nowak, Jörg Rothe
2008	J	`jnl`	Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control CoRR Gábor Erdélyi, Markus Nowak, Jörg Rothe
2007	B	`conf`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	J	`jnl`	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time CoRR Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
2007	J	`jnl`	Quantum cryptography: A survey. ACM Comput. Surv. Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe
2005	J	`jnl`	Quantum Cryptography: A Survey Electron. Colloquium Comput. Complex. Gábor Erdélyi, Tobias Riege, Jörg Rothe