# Infinite games on finite graphs using grossone

## Abstract

In his seminal work, Robert McNaughton [see McNaughton (Ann Pure Appl Log 65:149–184, 1993) and Khoussainov and Nerode (Automata theory and its applications. Birkhauser, Basel, 2001)] developed a model of infinite games played on finite graphs. This paper presents a new model of infinite games played on finite graphs using the grossone paradigm. The new grossone paradigm provides certain advantages such as allowing for draws, which are common in board games, and a more accurate and decisive method for determining the winner.

This is a preview of subscription content, log in via an institution to check access.

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

1. In Sergeyev (2003), Sergeyev formally presents the divisibility axiom as saying for any finite natural number n sets $${\mathbb {N}}_{k,n}, \; 1\le k\le n$$, being the nth parts of the set $${\mathbb {N}}$$, have the same number of elements indicated by the numeral $$\frac{{{\textcircled {1}}}}}{n$$ where

\begin{aligned} {\mathbb {N}}_{k,n}=\{k,k+n,k+2n,k+3n,\ldots \}, \; 1\le k \le n,\; \bigcup ^n_{k=1}{\mathbb {N}}_{k,n}={\mathbb {N}} \end{aligned}

and illustrates this with examples of the odd and even natural numbers.

2. Here it is also important to note that the grossone methodology is not related to nonstandard analysis [see Sergeyev (2019)].

3. Here we use the notion of complete taken from Sergeyev (2003), that is the sequence contains $${{\textcircled {1}}}$$ elements.

4. Here we take the convention, as found in Halmos (1974), that the $$\subset$$ symbol is reflexive.

## References

• Caldarola F (2018) The exact measures of the Sierpiński d-dimensional tetrahedron in connection with a Diophantine nonlinear system. Commun Nonlinear Sci Numer Simul 63:228–238

• D’Alotto L (2015) A classification of one-dimensional cellular automata using infinite computations. Appl Math Comput 255:15–24

• De Leone R (2018) Nonlinear programming and grossone: quadratic programming and the role of constraint qualifications. Appl Math Comput 318:290–297

• De Leone R, Fasano G, Sergeyev YD (2018) Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput Optim Appl 71(1):73–93

• Falcone A, Garro A, Mukhametzhanov, Sergeyev YD (2019) Representation of grossone-based arithmetic in simulink for scientific computing (submitted)

• Fiaschi L, Cococcioni M (2018) Numerical asymptotic results in game theory using sergeyev’s infinity computing. Int J Unconvent Comput 14(1):1–25

• Halmos PR (1974) Naive set theory. Springer, Berlin

• Iavernaro F, Mazzia F, Mukhametzhanov MS, Sergeyev YD (2020) Conjugate-symplecticity properties of Euler–Maclaurin methods and their implementation on the infinity Computer. Appl Numer Math 155:58–72

• Iudin DI, Sergeyev YD, Hayakawa M (2015) Infinity computations in cellular automaton forest-fire model. Commun Nonlinear Sci Numer Simul 20(3):861–870

• Khoussainov B, Nerode A (2001) Automata theory and its applications. Birkhauser, Basel

• Lolli G (2015) Metamathematical investigations on the theory of Grossone. Appl Math Comput 255:3–14

• Margenstern M (2011) Using Grossone to count the number of elements of infinite sets and the connection with bijections, p-Adic Numbers. Ultrametr Anal Appl 3(3):196–204

• McNaughton R (1993) Infinite games played on finite graphs. Ann Pure Appl Log 65:149–184

• Montagna F, Simi G, Sorbi A (2015) Taking the Pirahã seriously. Commun Nonlinear Sci Numer Simul 21(1–3):52–69

• Perrin D (1985) An introduction to finite automata on infinite words. In: Goos G, Hartmanis J (eds) Automata on infinite words, Lecture notes in computer science no. 192, Springer, Berlin, pp 2–17

• Rizza D (2018) How to make an infinite decision. Bull Symbol Log 24(2):227

• Rizza D (2019) Numerical methods for infinite decision-making processes. Int J Unconvent Comput 14(2):139–158

• Sergeyev YD (2003) Arithmetic of infinity. Edizioni Orizzonti Meridionali, Rome

• Sergeyev YD (2008) A new applied approach for executing computations with infinite and infinitesimal quantities. Informatica 19(4):567–596

• Sergeyev YD (2015a) The Olympic medals ranks, lexicographic ordering and numerical infinities. Math Intell 37(2):4–8

• Sergeyev YD (2015b) Computations with grossone-based infinities. In: Calude CS, Dinneen MJ (eds) Proceedings of the 14th international conference “unconventional computation and natural computation”. Lecture notes in computer science, vol 9252, Springer, Berlin, pp 89–106

• Sergeyev YD (2017) Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surv Math Sci 4(2):219–320

• Sergeyev YD (2019) Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite. Found Sci 24(1):153–170

• Sergeyev YD, Garro A (2010) Observability of turing machines: a refinement of the theory of computation. Informatica 21(3):425–454

• Zhigljavsky A (2012) Computing sums of conditionally convergent and divergent series using the concept of grossone. Appl Math Comput 218:8064–8076

## Acknowledgements

This research was supported by the following Grant: PSC-CUNY Research Award: TRADA-47-445

## Author information

Authors

### Corresponding author

Correspondence to Louis D’Alotto.

## Ethics declarations

### Conflict of interest

The author declares that he has no conflict of interest.

### Human and animal rights

This article does not contain any studies with human participants nor animals performed by the author.