NON-MANIPULABLE PARTITIONING

DOI10.1142/S1793005712400157zbMath1282.91094OpenAlexW2133188686MaRDI QIDQ2873494

Conal Duddy, Juan Perote-Peña, Ashley Piggins

Publication date: 24 January 2014

Published in: New Mathematics and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793005712400157

zbMATH Keywords

partitionsaggregationnon-manipulation

Mathematics Subject Classification ID

Social choice (91B14)

Related Items (1)

Strategy-proof partitioning

Cites Work

• Unnamed Item
• Rules for aggregating information
• Efficient and binary consensus functions on transitively valued relations
• Aggregation of equivalence relations
• On the use of ordered sets in problems of comparison and consensus of classifications
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• Which worlds are possible? A judgment aggregation problem
• Manipulation of Voting Schemes: A General Result
• The Simple Majority Decision Rule

This page was built for publication: NON-MANIPULABLE PARTITIONING