Abstract
In this talk I present two applications of computer-aided theorem discovery and verification. One is discovering classes of finite games that have unique pure Nash equilibria payoffs. The other is on using computer to verify the base case of Arrow’s impossibility theorem in social choice theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, F. (2009). Two Applications of Computer-Aided Theorem Discovery and Verification. In: Karagiannis, D., Jin, Z. (eds) Knowledge Science, Engineering and Management. KSEM 2009. Lecture Notes in Computer Science(), vol 5914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10488-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-10488-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10487-9
Online ISBN: 978-3-642-10488-6
eBook Packages: Computer ScienceComputer Science (R0)