Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities
From MaRDI portal
Recommendations
- Strategy-proof preference aggregation: possibilities and characterizations
- A fundamental structure of strategy-proof social choice correspondences with restricted preferences over alternatives
- Rationalizable strategies in games with incomplete preferences
- On the relation between preference reversal and strategy-proofness
- A non-contradictory extension of preference relations in decision-making problems
- Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility
- Strategyproof social choice when preferences and outcomes may contain ties
- Separable Preferences, Strategyproofness, and Decomposability
- Strategy-proof social choice with continuous separable preferences
- Strategy-proof social choice with exogenous indifference classes
Cited in
(9)- Optimal bounds for the no-show paradox via SAT solving
- An analytical and experimental comparison of maximal lottery schemes
- Strategyproof social choice when preferences and outcomes may contain ties
- Algorithmic decision theory meets logic (invited talk)
- Exploring the No-Show Paradox for Condorcet Extensions
- On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
- Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting
- Declarative approaches to outcome determination in judgment aggregation
- An extension of the Moulin no show paradox for voting correspondences
This page was built for publication: Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207043)
