Quantifier Elimination for Reasoning in Economics

We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. QE dates back to Tarski's work in the 1940s with software to perform it dating to the 1970s. There is a great body of work considering its application in science and engineering but we show here how it can also find application in the social sciences. We explain how many suggested theorems in economics could either be proven, or even have their hypotheses shown to be inconsistent, automatically; and describe the application of this in both economics education and research. We describe a bank of QE examples gathered from economics literature and note the structure of these are, on average, quite different to those occurring in the computer algebra literature. This leads us to suggest a new incremental QE approach based on result memorization of commonly occurring generic QE results.

[1]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[2]  Matthew England,et al.  Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition , 2015, ISSAC.

[3]  Christopher W. Brown QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[4]  Huang Zongyan,et al.  Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases , 2016 .

[5]  Takuya Matsuzaki,et al.  An Automated Deduction and Its Implementation for Solving Problem of Sequence at University Entrance Examination , 2016, ICMS.

[6]  Adam W. Strzebonski,et al.  Cylindrical Algebraic Decomposition using validated numerics , 2006, J. Symb. Comput..

[7]  Matthew England,et al.  Truth table invariant cylindrical algebraic decomposition , 2014, J. Symb. Comput..

[8]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

[9]  Thomas Sturm,et al.  A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications , 2017, Math. Comput. Sci..

[10]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[11]  Changbo Chen,et al.  Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains , 2014, CASC.

[12]  Matthew England,et al.  Optimising Problem Formulation for Cylindrical Algebraic Decomposition , 2013, MKM/Calculemus/DML.

[13]  A. Charalampakis,et al.  Analytical solutions for the minimum weight design of trusses by cylindrical algebraic decomposition , 2018 .

[14]  P. Reny,et al.  Advanced Microeconomic Theory , 2012 .

[15]  Hoon Hong,et al.  Real quantifier elimination for the synthesis of optimal numerical algorithms (Case study: Square root computation) , 2016, J. Symb. Comput..

[16]  R. Deb,et al.  A nonparametric analysis of multi-product oligopolies , 2014 .

[17]  Christopher W. Brown Improved Projection for Cylindrical Algebraic Decomposition , 2001, J. Symb. Comput..

[18]  Matthew England,et al.  Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks , 2017, CASC.

[19]  Anna Maria Bigatti,et al.  Satisfiability Checking meets Symbolic Computation (Project Paper) , 2016, International Conference on Intelligent Computer Mathematics.

[20]  Changbo Chen,et al.  Quantifier elimination by cylindrical algebraic decomposition based on regular chains , 2014, J. Symb. Comput..

[21]  Dongming Wang,et al.  Computing Equilibria of Semi-algebraic Economies Using Triangular Decomposition and Real Solution Classification , 2013, ArXiv.

[22]  J. Hicks,et al.  Value and Capital , 2017 .

[23]  Andreas Seidl,et al.  Efficient projection orders for CAD , 2004, ISSAC '04.

[24]  Colin Rowat,et al.  Sound Auction Specification and Implementation , 2015, EC.

[25]  Christopher W. Brown Open Non-uniform Cylindrical Algebraic Decompositions , 2015, ISSAC.

[26]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[27]  Changbo Chen,et al.  Computing cylindrical algebraic decomposition via triangular decomposition , 2009, ISSAC '09.

[28]  Matthew England,et al.  A Case Study on the Parametric Occurrence of Multiple Steady States , 2017, ISSAC.

[29]  Christopher W. Brown Constructing a single open cell in a cylindrical algebraic decomposition , 2013, ISSAC '13.

[30]  Hirokazu Anai,et al.  SyNRAC: A Toolbox for Solving Real Algebraic Constraints , 2014, ICMS.

[31]  Adam W. Strzebonski Cylindrical algebraic decomposition using local projections , 2016, J. Symb. Comput..

[32]  G. Sacks A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[33]  Daniel Kroening,et al.  SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper) , 2016, CICM.

[34]  Matthew England,et al.  Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition , 2014, CICM.

[35]  Hirokazu Anai,et al.  Efficient Subformula Orders for Real Quantifier Elimination of Non-prenex Formulas , 2015, MACIS.

[36]  C. Mulligan The Redistribution Recession: How Labor Market Distortions Contracted the Economy , 2012 .

[37]  Dejan Jovanović,et al.  Solving Non-linear Arithmetic , 2012, IJCAR.

[38]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.