Automated reasoning in social choice theory: some remarks

DOI10.1007/s11786-014-0177-xzbMath1302.91077arXiv1403.3391OpenAlexW2055770547MaRDI QIDQ475377

Arunava Sen, Siddharth Chatterjee

Publication date: 26 November 2014

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.3391

zbMATH Keywords

automated reasoningsocial choice theoryreview

Mathematics Subject Classification ID

Related Items (2)

Optimal bounds for the no-show paradox via SAT solving ⋮ An introduction to mechanized reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Computer-aided proofs of Arrow's and other impossibility theorems
• Strategy-proof social choice with exogenous indifference classes
• A note on social choice theory without the Pareto principle
• Dictatorial domains
• A note on Bossert, Pattanaik and Xu's ``Choice under complete uncertainty: axiomatic characterization of some decision rules
• Choice under complete uncertainty: Axiomatic characterizations of some decision rules
• Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
• A Representation Theorem for "Preference for Flexibility"
• Optimal Auction Design
• Manipulation of Schemes that Mix Voting with Chance
• Strategyproof Assignment by Hierarchical Exchange
• Another direct proof of the Gibbard-Satterthwaite theorem

This page was built for publication: Automated reasoning in social choice theory: some remarks