Approximating weighted and priced bribery in scoring rules

DOI10.1613/JAIR.1.11538zbMATH Open1452.91128OpenAlexW2996800878MaRDI QIDQ5207044FDOQ5207044

Authors: Orgad Keller, Avinatan Hassidim, Noam Hazon 

Publication date: 3 January 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11538

Recommendations

• How hard is bribery in elections?
• Voting and bribing in single-exponential time
• Approximation and hardness of shift-bribery
• Frugal bribery in voting
• New Approximations for Coalitional Manipulation in Scoring Rules

zbMATH Keywords

scoring rulesbriberyminimal subset of voters

Mathematics Subject Classification ID

Voting theory (91B12)

Cited In (7)

• Approximation and hardness of shift-bribery
• How hard is safe bribery?
• On the hardness of bribery variants in voting with CP-nets
• Local distance constrained bribery in voting
• Dichotomy for pure scoring rules under manipulative electoral actions
• Voting and bribing in single-exponential time
• Frugal bribery in voting

This page was built for publication: Approximating weighted and priced bribery in scoring rules

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