Group control for consent rules with consecutive qualifications

DOI10.1016/j.mathsocsci.2022.11.003zbMath1506.91048OpenAlexW4310062886MaRDI QIDQ2682019

Yongjie Yang, Dinko Dimitrov

Publication date: 31 January 2023

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2022.11.003

zbMATH Keywords

integer linear programmingpolynomial-time solvabilitygroup identificationconsent rulesconsecutive-ones

Mathematics Subject Classification ID

Integer programming (90C10) Group preferences (91B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• Call control in rings
• Group identification
• Majority voting on restricted domains
• Matching is as easy as matrix inversion
• How hard is it to control an election?
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Between liberalism and democracy.
• PC trees and circular-ones arrangements.
• Group identification: an integrated approach
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Computational Aspects of Nearly Single-Peaked Electorates
• Optimizing over Consecutive 1's and Circular 1's Constraints
• Cyclic Scheduling via Integer Programs with Circular Ones
• The complexity of restricted spanning tree problems
• Preferences Single-Peaked on a Circle
• Control and Bribery in Voting

This page was built for publication: Group control for consent rules with consecutive qualifications