Related papers: Taming the wild in impartial combinatorial games
The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…
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,…
This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
Mean-field game theory relies on approximating games that are intractable to model due to a very large to infinite population of players. While these kinds of games can be solved analytically via the associated system of partial…
We propose a general framework for statistical inference on the overall strengths of players in pairwise comparisons, allowing for potential shifts in the covariate distribution. These covariates capture important contextual information…
We investigate further several properties of the minority game we have recently introduced. We explain the origin of the phase transition and give an analytical expression of $\sigma^2/N$ in the $N\ll2^M$ region. The ability of the players…
Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…
We prove that the number of parameters defining a complex of projective modules over a finite dimensional algebra is upper semi-continuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get…
This is an introduction into John Conway's beautiful Combinatorial Game Theory, providing precise statements and detailed proofs for the fundamental parts of his theory. (1) Combinatorial game theory, (2) the GROUP of games, (3) the FIELD…
Generalized statistical arbitrage concepts are introduced corresponding to trading strategies which yield positive gains on average in a class of scenarios rather than almost surely. The relevant scenarios or market states are specified via…
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:…
We introduce two notions of algebraic entropy for actions of cancellative right amenable semigroups $S$ on discrete abelian groups $A$ by endomorphisms; these extend the classical algebraic entropy for endomorphisms of abelian groups,…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…
The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…
A game-theoretic model of social preference and enlightened self-interest is formulated. Existence of symmetry and duality in the game matrices with altruistic social preference is revealed. The model is able to quantitatively describe the…
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to…
We study a three-player variation of the impartial avoidance game introduced by Anderson and Harary. Three players take turns selecting previously-unselected elements of a finite group. The losing player is the one who selects an element…
It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…
The problem of subgroups is ubiquitous in scientific research (ex. disease heterogeneity, spatial distributions in ecology...), and piecewise regression is one way to deal with this phenomenon. Morse-Smale regression offers a way to…