Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results

DOI10.1613/jair.1.12332OpenAlexW3040875172MaRDI QIDQ5026258

Edith Elkind, Dominik Peters, Hau Chan, Lan Yu

Publication date: 7 February 2022

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

Full work available at URL: https://arxiv.org/abs/2007.06549

zbMATH Keywords

game theorypreferences

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms ⋮ Structured preferences: a literature survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strategy-proof location on a network
• The complexity of Kemeny elections
• Exact algorithms and applications for tree-like Weighted Set Cover
• Clustering to minimize the maximum intercluster distance
• Voting schemes for which it can be difficult to tell who won the election
• Recognizing single-peaked preferences on a tree
• Single-peaked orders on a tree
• The structure of non-manipulable social choice rules on a tree
• Exact complexity of the winner problem for Young elections
• Stable matching with preferences derived from a psychological model
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
• Handbook of social choice and welfare. Vol. 1.
• Condorcet domains, median graphs and the single-crossing property
• Sorting out single-crossing preferences on networks
• On the complexity of achieving proportional representation
• The complexity of fully proportional representation for single-crossing electorates
• On the Computation of Fully Proportional Representation
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Eliciting Single-Peaked Preferences Using Comparison Queries
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
• A REVIEW OF TREE CONVEX SETS TEST
• Reducibility among Combinatorial Problems
• Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs
• Incomplete Preferences in Single-Peaked Electorates
• Preferences Single-Peaked on a Circle
• An Exploration in the Theory of Optimum Income Taxation

This page was built for publication: Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results