Related papers: Game values of arithmetic functions

We study a class of probabilistic cooperative games which can be treated as an extension of the classical cooperative games with transferable utilities. The coalitions have an exogenous probability of being realized. This probability…

We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…

Effectivity functions are the basic formalism for investigating the semantics game logic. We discuss algebraic properties of stochastic effectivity functions, in particular the relationship to stochastic relations, morphisms and congruences…

This paper concerns value functions of time-dependent tug-of-war games. We first prove the existence and uniqueness of value functions and verify that these game values satisfy a dynamic programming principle. Using the arguments in the…

We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals:…

Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…

In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…

A finite impartial game is a two-player game in which the players take turns making moves and the game ends after finitely many moves. In this paper, we study a class of finite impartial games introduced by H.~Lenstra, which we call coin…

We present a unifying representation of computation as a two-player game between an \emph{Algorithm} and \emph{Nature}, grounded in domain theory and game theory. The Algorithm produces progressively refined approximations within a Scott…

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…

We study an alternating sum involving factorials and Stirling numbers of the first kind. We give an exponential generating function for these numbers and show they are nonnegative and enumerate the number of increasing trees on $n$ vertices…

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…

This work introduces the concept of Variable Size Game Theory (VSGT), in which the number of players in a game is a strategic decision made by the players themselves. We start by discussing the main examples in game theory: dominance,…

Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games. In this paper I…

A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…

One of the long-debated issues in coalitional game theory is how to extend the Shapley value to games with externalities (partition-function games). When externalities are present, not only can a player's marginal contribution - a central…

Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional…

A mathematical model for behavioral changes by pair interactions (i.e. due to direct contact) of individuals is developed. Three kinds of pair interactions can be distinguished: Imitative processes, avoidance processes, and compromising…