Automated reasoning in social choice theory: some remarks
From MaRDI portal
Publication:475377
DOI10.1007/S11786-014-0177-XzbMATH Open1302.91077arXiv1403.3391OpenAlexW2055770547MaRDI QIDQ475377FDOQ475377
Authors: Siddharth Chatterjee, Arunava Sen 
Publication date: 26 November 2014
Published in: Mathematics in Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1403.3391
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
- A Representation Theorem for "Preference for Flexibility"
- Optimal Auction Design
- Strategyproof Assignment by Hierarchical Exchange
- Title not available (Why is that?)
- 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
- A note on social choice theory without the Pareto principle
- Automated search for impossibility theorems in social choice theory: ranking sets of objects
- Manipulation of Schemes that Mix Voting with Chance
- Computer-aided proofs of Arrow's and other impossibility theorems
- Another direct proof of the Gibbard-Satterthwaite theorem
- Dictatorial domains
- Strategy-proof social choice with exogenous indifference classes
- Title not available (Why is that?)
Cited In (7)
- Automated search for impossibility theorems in social choice theory: ranking sets of objects
- First-order logic formalisation of Arrow's theorem
- Verifying randomised social choice
- Formalizing Arrow's theorem
- Optimal bounds for the no-show paradox via SAT solving
- An introduction to mechanized reasoning
- Computer-aided proofs of Arrow's and other impossibility theorems
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)
