Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
From MaRDI portal
Publication:3081450
DOI10.1613/jair.3126zbMath1214.68382arXiv1401.3866MaRDI 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
Related Items
Foreword, Taxonomy of powerful voters and manipulation in the framework of social choice functions, On manipulation in merging epistemic states, First-order logic formalisation of impossibility theorems in preference aggregation, Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs, Automated reasoning in social choice theory: some remarks, An introduction to mechanized reasoning, A graphical study of comparative probabilities, Possibilistic reasoning with partially ordered beliefs, Iterative voting and acyclic games, Optimal bounds for the no-show paradox via SAT solving, Sincerity and manipulation under approval voting, \(k\)-majority digraphs and the hardness of voting with a constant number of voters, Ranking sets of interacting objects via semivalues, Min-max decision rules for choice under complete uncertainty: axiomatic characterizations for preferences over utility intervals, Strategyproof social choice when preferences and outcomes may contain ties, Applications of Logic in Social Choice Theory, Unnamed Item, Algorithmic Decision Theory Meets Logic
Uses Software
