Non-Archimedean game theory: A numerical approach

Abstract In this paper we consider the Pure and Impure Prisoner’s Dilemmas. Our purpose is to theoretically extend them when using non-Archimedean quantities and to work with them numerically, potentially on a computer. The recently introduced Sergeyev’s Grossone Methodology proved to be effective in addressing our problem, because it is both a simple yet effective way to model non-Archimedean quantities and a framework which allows one to perform numerical computations between them. In addition, we could be able, in the future, to perform the same computations in hardware, resorting to the infinity computer patented by Sergeyev himself. After creating the theoretical model for Pure and Impure Prisoner’s Dilemmas using Grossone Methodology, we have numerically reproduced the diagrams associated to our two new models, using a Matlab simulator of the Infinity Computer. Finally, we have proved some theoretical properties of the simulated diagrams. Our tool is thus ready to assist the modeler in all that problems for which a non-Archimedean Pure/Impure Prisoner’s Dilemma model provides a good description of reality: energy market modeling, international trades modeling, political merging processes, etc.

[1]  Marco Cococcioni,et al.  Generalizing Pure and Impure Iterated Prisoner's Dilemmas to the Case of Infinite and Infinitesimal Quantities , 2019, NUMTA.

[2]  L. Fanti,et al.  Profitability of corporate social responsibility in network industries , 2018 .

[3]  Hal R. Varian,et al.  Information rules - a strategic guide to the network economy , 1999 .

[4]  Marco Cococcioni,et al.  Towards lexicographic multi-objective linear programming using grossone methodology , 2016 .

[5]  Michael Z. Q. Chen,et al.  Evolutionary fate of memory-one strategies in repeated prisoner’s dilemma game in structured populations , 2017 .

[6]  Marco Cococcioni,et al.  Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing , 2018, Int. J. Unconv. Comput..

[7]  Yaroslav D. Sergeyev,et al.  On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales , 2018, Commun. Nonlinear Sci. Numer. Simul..

[8]  Davide Rizza,et al.  A Study of Mathematical Determination through Bertrand’s Paradox , 2018 .

[9]  Yaroslav D. Sergeyev,et al.  Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems , 2017 .

[10]  Francesco Squintani,et al.  Moral hazard, renegotiation, and forgetfulness , 2003, Games Econ. Behav..

[11]  Marco Cococcioni,et al.  Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems , 2019, NUMTA.

[12]  Ethan Akin,et al.  What You Gotta Know to Play Good in the Iterated Prisoner's Dilemma , 2015, Games.

[13]  Leonard F. S. Wang,et al.  Collusion in a differentiated duopoly with network externalities , 2017 .

[14]  Alfredo Garro,et al.  Single-tape and multi-tape Turing machines through the lens of the Grossone methodology , 2013, The Journal of Supercomputing.

[15]  Massimo Veltri,et al.  Usage of infinitesimals in the Menger's Sponge model of porosity , 2011, Appl. Math. Comput..

[16]  Yaroslav D. Sergeyev,et al.  The Olympic Medals Ranks, Lexicographic Ordering, and Numerical Infinities , 2015, 1509.04313.

[17]  Yaroslav D. Sergeyev,et al.  Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology , 2020, Commun. Nonlinear Sci. Numer. Simul..

[18]  Joseph Y. Halpern.  Lexicographic probability, conditional probability, and nonstandard probability , 2001, Games Econ. Behav..

[19]  Nguyen Duc Trung,et al.  Oligopoly Model and Its Applications in International Trade , 2019, ECONVN.

[20]  Augustin M. Cournot.  Cournot, Antoine Augustin: Recherches sur les principes mathématiques de la théorie des richesses , 2019, Die 100 wichtigsten Werke der Ökonomie.

[21]  Louis D'Alotto.  A classification of one-dimensional cellular automata using infinite computations , 2015, Appl. Math. Comput..

[22]  Marco Cococcioni,et al.  Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm , 2018, Appl. Math. Comput..

[23]  Product homogeneity as a prisoner's dilemma in a duopoly with R&D , 1998 .

[24]  Yaroslav D. Sergeyev,et al.  The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area , 2015, Commun. Nonlinear Sci. Numer. Simul..

[25]  Alfredo Garro,et al.  Observability of Turing Machines: A Refinement of the Theory of Computation , 2010, Informatica.

[26]  L. Lambertini,et al.  Optimal punishments in linear duopoly supergames with product differentiation , 1999 .

[27]  Marco Cococcioni,et al.  Solving mixed Pareto-Lexicographic multi-objective optimization problems: The case of priority chains , 2020, Swarm Evol. Comput..

[28]  Vieri Benci,et al.  Infinitesimal Probabilities* , 2016, The British Journal for the Philosophy of Science.

[29]  Yaroslav D. Sergeyev,et al.  A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic , 2017, Math. Comput. Simul..

[30]  A. Robinson.  Non-standard analysis , 1966 .

[31]  Marcella Scrimitore,et al.  Tacit collusion and market concentration under network effects , 2016 .

[32]  L. Lambertini.  Prisoners’ Dilemma in Duopoly (Super)games , 1997 .

[33]  C. Shapiro,et al.  Network Externalities, Competition, and Compatibility , 1985 .

[34]  Ronnie Sircar,et al.  Oligopoly games under asymmetric costs and an application to energy production , 2012 .

[35]  Yaroslav D. Sergeyev,et al.  Computations with Grossone-Based Infinities , 2015, UCNC.

[36]  A. Rapoport,et al.  Prisoner's Dilemma , 1965 .

[37]  Alexander J. Stewart,et al.  From extortion to generosity, evolution in the Iterated Prisoner’s Dilemma , 2013, Proceedings of the National Academy of Sciences.

[38]  Gabriele Lolli,et al.  Metamathematical investigations on the theory of Grossone , 2015, Appl. Math. Comput..

[39]  Cristian S. Calude,et al.  Infinitesimal Probabilities Based on Grossone , 2019, SN Computer Science.

[40]  Arne Traulsen,et al.  Partners or rivals? Strategies for the iterated prisoner's dilemma☆ , 2015, Games Econ. Behav..

[41]  Yaroslav D. Sergeyev,et al.  Independence of the Grossone-Based Infinity Methodology from Non-standard Analysis and Comments upon Logical Fallacies in Some Texts Asserting the Opposite , 2018, Foundations of Science.

[42]  Guofang Nan,et al.  Risk consideration and cooperation in the iterated prisoner’s dilemma , 2016, Soft Comput..

[43]  Manlio Gaudioso,et al.  Numerical infinitesimals in a variable metric method for convex nonsmooth optimization , 2018, Appl. Math. Comput..

[44]  Fabio Caldarola.  The Sierpinski curve viewed by numerical computations with infinities and infinitesimals , 2018, Appl. Math. Comput..

[45]  Maurice Margenstern.  Fibonacci words, hyperbolic tilings and grossone , 2015, Commun. Nonlinear Sci. Numer. Simul..

[46]  Vieri Benci,et al.  Numerosities of labelled sets: a new way of counting , 2003 .

[47]  Yaroslav D. Sergeyev,et al.  Numerical Methods for Solving Initial Value Problems on the Infinity Computer , 2016, Int. J. Unconv. Comput..

[48]  S. Vickers.  Topology via Logic , 1989 .