scientific article
From MaRDI portal
Publication:3384086
zbMath1484.91174arXiv1707.08760MaRDI QIDQ3384086
Publication date: 14 December 2021
Full work available at URL: https://arxiv.org/abs/1707.08760
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast, flexible MUS enumeration
- Condorcet's principle and the strong no-show paradoxes
- Anonymous, neutral, and strategy-proof rules on the Condorcet domain
- One-way monotonicity as a form of strategy-proofness
- An extension of the Moulin no show paradox for voting correspondences
- Computer-aided proofs of Arrow's and other impossibility theorems
- Concorcet's principle implies the no show paradox
- Dictatorial domains
- A strategy-proofness characterization of majority rule
- Revisiting the connection between the no-show paradox and monotonicity
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- The strong no show paradoxes are a common flaw in Condorcet voting correspondences
- Monotonicity properties and their adaptation to irresolute social choice rules
- Non-monotonicity does not imply the no-show paradox
- Finding Strategyproof Social Choice Functions via SAT Solving
- Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
- Compositional Propositional Proofs
- Paradoxes of Preferential Voting
- Introduction to the Theory of Voting
This page was built for publication:
