Finding strategyproof social choice functions via SAT solving
From MaRDI portal
Recommendations
- Proving the incompatibility of efficiency and strategyproofness via SMT solving
- Automated search for impossibility theorems in social choice theory: ranking sets of objects
- Strategyproof social choice when preferences and outcomes may contain ties
- Optimal bounds for the no-show paradox via SAT solving
- Computer-aided proofs of Arrow's and other impossibility theorems
Cited in
(19)- On the tradeoff between efficiency and strategyproofness
- Optimal bounds for the no-show paradox via SAT solving
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Manipulability in a group activity selection problem
- Strategyproof social choice when preferences and outcomes may contain ties
- Automated search for impossibility theorems in social choice theory: ranking sets of objects
- Condorcet's principle and the preference reversal paradox
- Algorithmic decision theory meets logic (invited talk)
- Proving the incompatibility of efficiency and strategyproofness via SMT solving
- Individually Rational Strategy-Proof Social Choice with Exogenous Indifference Sets
- An introduction to mechanized reasoning
- A note on the McKelvey uncovered set and Pareto optimality
- Characterizing the top cycle via strategyproofness
- Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting
- Formalising fairness in the assignment problem with ordinal preferences in Isabelle/HOL
- Finding periodic apartments via Boolean satisfiability and orderly generation
- Declarative approaches to outcome determination in judgment aggregation
- Universal Pareto dominance and welfare for plausible utility functions
- Set-monotonicity implies Kelly-strategyproofness
This page was built for publication: Finding strategyproof social choice functions via SAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794662)
