Generalizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal Quantities

DOI10.1007/978-3-030-40616-5_32OpenAlexW3005670951MaRDI QIDQ5122313

Lorenzo Fiaschi, Marco Cococcioni

Publication date: 22 September 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_32

zbMATH Keywords

game theoryPrisoner's DilemmaInfinity ComputerGrossone methodologynon-Archimedean payoffs and probabilities

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (2)

Non-standard analysis revisited: an easy axiomatic presentation oriented towards numerical applications ⋮ Non-Archimedean zero-sum games

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prisoners' dilemma in duopoly (super) games
• Optimal punishments in linear duopoly supergames with product differentiation
• Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
• Non-Archimedean game theory: a numerical approach
• Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
• Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• Partners or rivals? Strategies for the iterated prisoner's dilemma
• Infinitesimal Probabilities
• A Study of Mathematical Determination through Bertrand’s Paradox

This page was built for publication: Generalizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal Quantities