Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Cardinality of Infinite Games (0912.5524v2)

Published 30 Dec 2009 in math.CT, cs.GT, and math.CO

Abstract: The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a single iteration of the play, where there are an infinite amount of iterations. There are two distinct concepts within this broad definition which encompass all infinite games: the strong infinite game and the weak infinite game. Both differ in terms of imputations. The strong infinite game has a uniqueness qualification in that all moves must differ to the extent that no imputation (these occur at the end of any given iteration) may ever be the same. Conversely, there is no such qualification in a weak infinite game, any payout may equal another. Another property shared by strong and weak infinite games (apart from their fulfilling the criterion of an infinite game) is the fact that both consist of a countably infinite amount of moves. Therefore all infinite games have a countably infinite number of turns; the set of all infinite games is composed of each strong and weak infinite game. This result has a very important consequence: the ordinality of turns. That is, the moves of an infinite game have an order or structure which they adhere to. It is this structure which provides any future development or game theoretical analysis of these sorts of games with the necessary foundation.

Summary

We haven't generated a summary for this paper yet.