Voting in Combinatorial Domains

DOI10.1017/cbo9781107446984.010zbMath1452.91129OpenAlexW2490950911MaRDI QIDQ5133012

Jérôme Lang, Lirong Xia

Publication date: 12 November 2020

Full work available at URL: https://doi.org/10.1017/cbo9781107446984.010

zbMATH Keywords

preference aggregationvoting on domains

Mathematics Subject Classification ID

Voting theory (91B12)

Related Items (12)

On the manipulability of a class of social choice functions: plurality \(k\)th rules ⋮ Properties of multiwinner voting rules ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ Multi resource allocation with partial preferences ⋮ A graph theoretical approach to decisions in social choice, law, A.I. ⋮ Iterative deliberation via metric aggregation ⋮ Coincidence of Condorcet committees ⋮ Representative Committees of Peers ⋮ Voting on multi-issue domains with conditionally lexicographic preferences ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting

This page was built for publication: Voting in Combinatorial Domains