default search action
Gábor Erdélyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]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): 41 (2021) - [j12]Olivia Johanna Erdélyi, Gábor Erdélyi:
The AI Liability Puzzle and A Fund-Based Work-Around. J. Artif. Intell. Res. 70: 1309-1334 (2021) - [i14]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 abs/2111.07545 (2021) - [i13]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 abs/2111.13304 (2021) - 2020
- [j11]Gábor Erdélyi, Christian Reger, Yongjie Yang
The complexity of bribery and control in group identification. Auton. Agents Multi Agent Syst. 34(1): 8 (2020) - [j10]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: 13-33 (2020) - [c21]Olivia Johanna Erdélyi, Gábor Erdélyi:
The AI Liability Puzzle and a Fund-Based Work-Around. AIES 2020: 50-56 - [c20]Gábor Erdélyi, Yongjie Yang:
Microbribery in Group Identification. AAMAS 2020: 1840-1842
2010 – 2019
- 2019
- [c19]Gábor Erdélyi, Christian Reger, Yongjie Yang:
Towards Completing the Puzzle: Solving Open Problems for Control in Elections. AAMAS 2019: 846-854 - [i12]Olivia Johanna Erdélyi, Gábor Erdélyi:
The AI Liability Puzzle and A Fund-Based Work-Around. CoRR abs/1911.08005 (2019) - 2017
- [j9]Gábor Erdélyi, Martin Lackner
Computational Aspects of Nearly Single-Peaked Electorates. J. Artif. Intell. Res. 58: 297-337 (2017) - [c18]Gábor Erdélyi, Christian Reger, Yongjie Yang
Complexity of Group Identification with Partial Information. ADT 2017: 182-196 - [c17]Gábor Erdélyi, Christian Reger, Yongjie Yang:
The Complexity of Bribery and Control in Group Identification. AAMAS 2017: 1142-1150 - [c16]Gábor Erdélyi, Christian Reger:
Possible Voter Control in k-Approval and k-Veto Under Partial Information. BTW (Workshops) 2017: 185-192 - 2016
- [c15]Gábor Erdélyi, Christian Reger:
Possible Bribery in k-Approval and k-Veto Under Partial Information. AIMSA 2016: 299-309 - [c14]Dirk Briskorn, Gábor Erdélyi, Christian Reger:
Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract). AAMAS 2016: 1299-1300 - [p1]Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe:
Judgment Aggregation. Economics and Computation 2016: 361-391 - 2015
- [j8]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): 632-660 (2015) - [j7]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): 661-670 (2015) - [j6]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: 19-30 (2015) - [c13]Gábor Erdélyi, Martin Lackner
Manipulation of k-Approval in Nearly Single-Peaked Electorates. ADT 2015: 71-85 - [c12]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra
More Natural Models of Electoral Control by Partition. ADT 2015: 396-413 - 2014
- [j5]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014) - [c11]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bribery and voter control under voting-rule uncertainty. AAMAS 2014: 61-68 - [i11]Gábor Erdélyi, Edith Hemaspaandra, Lane A. Hemaspaandra:
More Natural Models of Electoral Control by Partition. CoRR abs/1410.2652 (2014) - 2013
- [c10]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. AAAI 2013: 283-289 - [c9]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Computational Aspects of Manipulation and Control in Judgment Aggregation. ADT 2013: 71-85 - 2012
- [c8]Edith Elkind, Gábor Erdélyi:
Manipulation under voting rule uncertainty. AAMAS 2012: 627-634 - [c7]Dorothea Baumeister, Gábor Erdélyi, Olivia Johanna Erdélyi, Jörg Rothe:
Control in Judgment Aggregation. STAIRS 2012: 23-34 - [i10]Gábor Erdélyi, Martin Lackner, Andreas Pfandler:
Computational Aspects of Nearly Single-Peaked Electorates. CoRR abs/1211.2627 (2012) - 2011
- [c6]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: 1-15 - [c5]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: 837-844 - [i9]Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe:
Control Complexity in Bucklin and Fallback Voting. CoRR abs/1103.2230 (2011) - 2010
- [c4]Gábor Erdélyi, Jörg Rothe:
Control Complexity in Fallback Voting. CATS 2010: 39-48 - [i8]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Control Complexity in Fallback Voting. CoRR abs/1004.3398 (2010) - [i7]Gábor Erdélyi, Michael R. Fellows:
Parameterized Control Complexity in Fallback Voting. CoRR abs/1004.3659 (2010) - [i6]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Bucklin Voting is Broadly Resistant to Control. CoRR abs/1005.4115 (2010)
2000 – 2009
- 2009
- [b1]Gábor Erdélyi:
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. Heinrich Heine University Düsseldorf, 2009, pp. 1-103 - [j4]Gábor Erdélyi, Lane A. Hemaspaandra
Frequency of correctness versus average polynomial time. Inf. Process. Lett. 109(16): 946-949 (2009) - [j3]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): 425-443 (2009) - [j2]Gábor Erdélyi, Lane A. Hemaspaandra
Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410(38-40): 3995-4000 (2009) - [c3]Gábor Erdélyi, Henning Fernau
The Complexity of Probabilistic Lobbying. ADT 2009: 86-97 - [i5]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009) - 2008
- [c2]Gábor Erdélyi, Markus Nowak, Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. MFCS 2008: 311-322 - [i4]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 abs/0806.0535 (2008) - [i3]Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas. CoRR abs/0806.2555 (2008) - 2007
- [j1]Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe:
Quantum cryptography: A survey. ACM Comput. Surv. 39(2): 6 (2007) - [c1]Gábor Erdélyi, Lane A. Hemaspaandra
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT 2007: 300-311 - [i2]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 abs/cs/0703097 (2007) - 2005
- [i1]Gábor Erdélyi, Tobias Riege, Jörg Rothe:
Quantum Cryptography: A Survey. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: