Related papers: Seeking a Game in which the standard model Group s…

We study a class of two-player zero-sum stochastic games known as \textit{blind stochastic games}, where players neither observe the state nor receive any information about it during the game. A central concept for analyzing long-duration…

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

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…

The principle that rational agents should maximize expected utility or choiceworthiness is intuitively plausible in many ordinary cases of decision-making under uncertainty. But it is less plausible in cases of extreme, low-probability risk…

Consider the following Maker-Breaker game. Fix a finite subset $S\subset\mathbb{N}$ of the naturals. The players Maker and Breaker take turns choosing previously unclaimed natural numbers. Maker wins by eventually building a homothetic copy…

In this work we present and analyze a fluid-mechanical model of competition (scavenging) amongst $N$ liquid droplets (individual competitors). The eventual outcome of this competition depends sensitively on the average resource (volume) per…

Let $\G$ be a limit group, $S\subset\G$ a subgroup, and $N$ the normaliser of $S$. If $H_1(S,\mathbb Q)$ has finite $\Q$-dimension, then $S$ is finitely generated and either $N/S$ is finite or $N$ is abelian. This result has applications to…

The Pythagorean Expected Wins Percentage Model was developed by Bill James to estimate a baseball team expected wins percentage over the course of a season. As such, the model can be used to assess how lucky or unfortunate a team was over…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

The problem of how to obtain quasi-classical states for quantum groups is examined. A measure of quantum indeterminacy is proposed, which involves expectation values of some natural quantum group operators. It is shown that within any…

Unitary representations of kinematical symmetry groups of quantum systems are fundamental in quantum theory. We propose in this paper its generalization to quantum kinematical groups. Using the method, proposed by us in a recent paper…

This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important…

We recognise that an entropy inequality akin to the main intermediate goal of recent works (Gowers, Green, Manners, Tao [3],[2]) regarding a conjecture of Marton provides a black box from which we can also through a short deduction recover…

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

We define a subgroup of the universal sofic group, obtained as the normaliser of a separable abelian subalgebra. This subgroup can be obtained as an extension by the group of automorphisms on a standard probability space. We show that each…

For a finite abelian group $G$ and a splitting field $K$ of $G$, let $d(G, K)$ denote the largest integer $l \in \N$ for which there is a sequence $S = g_1 \cdot ... \cdot g_l$ over $G$ such that $(X^{g_1} - a_1) \cdot ... \cdot (X^{g_l} -…

In a $(1:b)$ Maker-Breaker game, a primary question is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erd\H{o}s conjectured that the critical bias for many Maker-Breaker games played…

In an epsilon-approximate Nash equilibrium, a player can gain at most epsilon in expectation by unilateral deviation. An epsilon well-supported approximate Nash equilibrium has the stronger requirement that every pure strategy used with…

This position paper argues that machine learning for scientific discovery should shift from inductive pattern recognition to axiom-based reasoning. We propose a game design framework in which scientific inquiry is recast as a rule-evolving…

A model for decision making that generalizes Expected Utility Maximization is presented. This model, Expected Qualitative Utility Maximization, encompasses the Maximin criterion. It relaxes both the Independence and the Continuity…