Automated reasoning in social choice theory: some remarks

DOI10.1007/S11786-014-0177-XMaRDI QIDQ475377zbMATH OpenOpenAlexFDO

Authors Siddharth Chatterjee, Arunava Sen

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

social choice theoryautomated reasoningreview

Mathematics Subject Classification ID

Social choice (91B14) Mechanization of proofs and logical operations (03B35)

Abstract: Our objective in this note is to comment briefly on the newly emerging literature on computer-aided proofs in Social Choice Theory. We shall specifically comment on two papers, one by Tang and Lin (2009) and another by Geist and Endriss (2011). We also provide statements and brief descriptions of the results discussed in this note.

Recommendations

• Automated search for impossibility theorems in social choice theory: ranking sets of objects
• scientific article; zbMATH DE number 4104410
• Reasoning about social choice functions
• scientific article; zbMATH DE number 53302
• scientific article; zbMATH DE number 4119665
• A Short Introduction to Computational Social Choice
• scientific article; zbMATH DE number 1252517
• A Short Survey of Automated Reasoning

Cites work

• scientific article; zbMATH DE number 3976693 (Why is no real title available?)
• scientific article; zbMATH DE number 3637541 (Why is no real title available?)
• A Representation Theorem for "Preference for Flexibility"
• A note on Bossert, Pattanaik and Xu's ``Choice under complete uncertainty: axiomatic characterization of some decision rules
• A note on social choice theory without the Pareto principle
• Another direct proof of the Gibbard-Satterthwaite theorem
• Automated search for impossibility theorems in social choice theory: ranking sets of objects
• Choice under complete uncertainty: Axiomatic characterizations of some decision rules
• Computer-aided proofs of Arrow's and other impossibility theorems
• Dictatorial domains
• Manipulation of Schemes that Mix Voting with Chance
• Optimal Auction Design
• Strategy-proof social choice with exogenous indifference classes
• Strategyproof Assignment by Hierarchical Exchange

Cited in

(7)

• Verifying randomised social choice
• Optimal bounds for the no-show paradox via SAT solving
• Automated search for impossibility theorems in social choice theory: ranking sets of objects
• First-order logic formalisation of Arrow's theorem
• Computer-aided proofs of Arrow's and other impossibility theorems
• An introduction to mechanized reasoning
• Formalizing Arrow's theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475377)