Microbribery in group identification

DOI10.1007/S00224-026-10273-YMaRDI QIDQ7233475zbMATH OpenFDO

Authors Gábor Erdélyi, Yongjie Yang

Publication date 27 April 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-026-10273-Y

zbMATH Keywords

briberyconsent rulesgroup identificationNP-hardness

Mathematics Subject Classification ID

Theory of computing (68Qxx) Game theory (91Axx) Mathematical economics (91Bxx)

Cites work

• Between liberalism and democracy.
• Clustering to minimize the maximum intercluster distance
• Complexity of group identification with partial information
• Computational Complexity
• Depth-First Search and Linear Graph Algorithms
• Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division. Illustrations by Irene Rothe
• Group control for consent rules with consecutive qualifications
• Group identification
• Handbook of Computational Social Choice
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• Multiwinner rules with variable number of winners
• On the question ``who is a \(J\)?: a social choice approach
• Procedural group identification
• The complexity of probabilistic lobbying

This page was built for publication: Microbribery in group identification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233475)