Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
From MaRDI portal
Publication:3081450
DOI10.1613/jair.3126zbMath1214.68382arXiv1401.3866OpenAlexW2116274133MaRDI QIDQ3081450
Publication date: 8 March 2011
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3866
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
A graphical study of comparative probabilities ⋮ Algorithmic Decision Theory Meets Logic ⋮ First-order logic formalisation of impossibility theorems in preference aggregation ⋮ Iterative voting and acyclic games ⋮ Optimal bounds for the no-show paradox via SAT solving ⋮ Strategyproof social choice when preferences and outcomes may contain ties ⋮ Taxonomy of powerful voters and manipulation in the framework of social choice functions ⋮ Possibilistic reasoning with partially ordered beliefs ⋮ On manipulation in merging epistemic states ⋮ Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs ⋮ Sincerity and manipulation under approval voting ⋮ Unnamed Item ⋮ Foreword ⋮ Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals ⋮ Automated reasoning in social choice theory: some remarks ⋮ An introduction to mechanized reasoning ⋮ Applications of Logic in Social Choice Theory ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Ranking sets of interacting objects via semivalues
Uses Software
This page was built for publication: Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
