Gábor Erdélyi

Available identifiers

zbMath Open erdelyi.gaborMaRDI QIDQ837193

List of research outcomes

Publication	Date of Publication	Type
The AI Liability Puzzle and A Fund-Based Work-Around	2021-05-25	Paper
Complexity of control in judgment aggregation for uniform premise-based quota rules	2020-06-09	Paper
Complexity of group identification with partial information	2018-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4583946	2018-08-29	Paper
The complexity of probabilistic lobbying	2018-08-17	Paper
Computational Aspects of Nearly Single-Peaked Electorates	2017-02-17	Paper
Computational Aspects of Approval Voting	2016-11-08	Paper
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules	2015-12-18	Paper
More Natural Models of Electoral Control by Partition	2015-11-04	Paper
Manipulation of k-Approval in Nearly Single-Peaked Electorates	2015-11-04	Paper
Control complexity in Bucklin and fallback voting: a theoretical analysis	2015-02-20	Paper
Control complexity in Bucklin and fallback voting: an experimental analysis	2015-02-20	Paper
Computational Aspects of Manipulation and Control in Judgment Aggregation	2013-12-17	Paper
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation	2011-10-28	Paper
Frequency of correctness versus average polynomial time	2010-08-20	Paper
The Complexity of Probabilistic Lobbying	2009-11-17	Paper
Generalized juntas and NP-hard sets	2009-09-10	Paper
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control	2009-08-14	Paper
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control	2009-02-03	Paper
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time	2008-02-26	Paper

Research outcomes over time

This page was built for person: Gábor Erdélyi