Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Computer-aided proofs of arrow's and other impossibility theorems
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Discovering theorems in game theory: two-person games with unique pure nash equilibrium payoffs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
First-order logic formalisation of Arrow's theorem
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Automated search for impossibility theorems in social choice theory: ranking sets of objects
Journal of Artificial Intelligence Research
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs
Artificial Intelligence
A qualitative comparison of the suitability of four theorem provers for basic auction theory
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
Arrow's impossibility theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have been put forward. In this paper, we propose yet another alternative proof of the theorem. The basic idea is to use induction to reduce the theorem to the base case with 3 alternatives and 2 agents and then use computers to verify the base case. This turns out to be an effective approach for proving other impossibility theorems such as Muller-Satterthwaite and Sen's theorems as well. Motivated by the insights of the proof, we discover a new theorem with the help of computer programs. We believe this new proof opens an exciting prospect of using computers to discover similar impossibility or even possibility results.