Sequential composition of voting rules in multi-issue domains
From MaRDI portal
Publication:1042318
DOI10.1016/j.mathsocsci.2008.12.010zbMath1176.91031MaRDI QIDQ1042318
Publication date: 7 December 2009
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2008.12.010
91B12: Voting theory
Related Items
On the hardness of bribery variants in voting with CP-nets, A distributed social choice protocol for combinatorial domains, Compactly representing utility functions using weighted goals and the Max aggregator, Making choices with a binary relation: relative choice axioms and transitive closures, Bidding games and efficient allocations, Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains, Voting on multi-issue domains with conditionally lexicographic preferences, Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting, Bribery in voting with CP-nets, Approximately classic judgement aggregation, Lifting integrity constraints in binary aggregation, Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting, Aggregating preferences represented by conditional preference networks, Does Choosing Committees from Approval Balloting Fulfill the Electorate’s Will?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Only a dictatorship is efficient
- Logical preference representation and combinatorial vote
- Composition-consistent tournament solutions and social choice functions
- The paradox of multiple elections
- A strong paradox of multiple elections
- Classifying interdependence in multidimensional binary preferences
- Ensuring Pareto optimality by referendum voting
- Separable discrete preferences
- Permutations of separable preference orders
- Separable Preferences, Strategyproofness, and Decomposability
- The Structure of Utility Functions
