Committee Elections with Candidate Attribute Constraints
Aizhong Zhou, Fengbo Wang, Jiong Guo

TL;DR
This paper studies a committee election problem with candidate attribute constraints, providing a complexity classification and identifying conditions for polynomial solvability and fixed-parameter tractability.
Contribution
It offers a dichotomy theorem for the problem's complexity and analyzes its parameterized complexity under various parameters.
Findings
Polynomial-time solvable when each candidate has one attribute and each attribute appears once in constraints.
NP-hard if these conditions are violated.
Fixed-parameter tractability when parameterized by attributes or candidates.
Abstract
In many real-world applications of committee elections, the candidates are associated with certain attributes and the chosen committee is required to satisfy some constraints posed on the candidate attributes. For instance, when dress collocation, it is generally acknowledged that when wearing a tie, you'd better wear a shirt, and wearing a suit, you'd better wear leather shoes. Here, dresses are categorized by upper garment, lower garment, shoes et.al, and upper garment is with the attribute tie and shirt, lower garment is with the attribute suit, and shoes is with the attribute leather. And two constraints "tie infers shirt" and "suit infers leather shoes" are proposed. We study this variant of committee elections from the computational complexity viewpoint. Given a set of candidates, each with some attributes and a profit, and a set of constraints, given as propositional logical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Electoral Systems and Political Participation · Local Government Finance and Decentralization
