Single-switch preferences and the Ostrogorski paradox
From MaRDI portal
(Redirected from Publication:855755)
Recommendations
Cites work
- scientific article; zbMATH DE number 1414348 (Why is no real title available?)
- A possibility theorem on aggregation over multiple interconnected propositions
- A strong paradox of multiple elections
- Aggregating sets of judgments: two impossibility results compared. With a comment by Isaac Levi
- Aggregation of binary evaluations
- Anscombe's paradox and the rule of three-fourths
- Avoiding Anscombe's paradox
- Judgment aggregation: (im)possibility theorems
- On constructing a generalized Ostrogorski paradox: Necessary and sufficient conditions
- Representation in majority tournaments
- The Ostrogorski paradox
- The ostrogorski paradox and its relation to nontransitive choice
- The paradox of multiple elections
- The probability of inconsistencies in complex collective decisions
- Two-stage discrete aggregation: The Ostrogorski paradox and related phenomena
- Voting paradoxes and referenda
Cited in
(14)- Connections and implications of the Ostrogorski paradox for spatial voting models
- The budget-voting paradox
- The ostrogorski paradox and its relation to nontransitive choice
- Pareto efficiency in multiple referendum
- Does choosing committees from approval balloting fulfill the electorate's will?
- When are committees of Condorcet winners Condorcet winning committees?
- Condorcet choice and the Ostrogorski paradox
- Thin rationality and representation of preferences with implications to spatial voting models
- Unanimity and the Anscombe's paradox
- Compromise in combinatorial vote
- Majority voting on restricted domains
- Multi-dimensional rules
- On constructing a generalized Ostrogorski paradox: Necessary and sufficient conditions
- Triple-consistent social choice and the majority rule
This page was built for publication: Single-switch preferences and the Ostrogorski paradox
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855755)