Related papers: Small Representation Principle
An asymmetric generalization of classical Cournot's duopoly game was introduced and the simulation scheme of its quantized version was analyzed. In this scheme, the player assigned by a 'classical' measurement scheme always wins the player…
In the Maker-Breaker domination game played on a graph $G$, Dominator's goal is to select a dominating set and Staller's goal is to claim a closed neighborhood of some vertex. We study the cases when Staller can win the game. If Dominator…
Gauging $B-L$ symmetry provides a simple realization of the seesaw mechanism in a naturally anomaly free extension to the MSSM gauge group, $SU(3)_c\times SU(2)_L\times U(1)_Y \times U(1)_{B-L}$. However, as we discuss in here, it turns out…
The Minority Game is a simple model for the collective behavior of agents in an idealized situation where they have to compete through adaptation for a finite resource. This review summarizes the statistical mechanics community efforts to…
Our main proposition is that field equations for all spins can be obtained from Casimir eigenvalue equations for Poincare group. We have already confirm that statement for massive scalar, spinor and vector fields in Ref.[1]. In the present…
According to Shapley's game-theoretical result, there exists a unique game value of finite cooperative games that satisfies axioms on additivity, efficiency, null-player property and symmetry. The original setting requires symmetry with…
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been…
Wigner's method of induced representations is applied to the N=1 super-Poincare group, and by using a state corresponding to the basic vector of the little group as a Clifford vacuum we show that the spin operator of a supersymmetric point…
Motivated by a paradigm shift towards a hyper-connected world, we develop a computationally tractable small-gain theorem for a network of infinitely many systems, termed as infinite networks. The proposed small-gain theorem addresses…
We study a game first introduced by Martin (actually we use a slight variation of this game) which plays a role for measure analogous to the Banach-Mazur game for category. We first present proofs for the basic connections between this game…
We present lattice simulation results corresponding to an SU(2) pure gauge theory defined on the orbifold space E_4 x I_1, where E_4 is the four-dimensional Euclidean space and I_1 is an interval, with the gauge symmetry broken to a U(1)…
We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule. In this setting, voters and candidates are embedded in a $d$-dimensional Euclidean space, and the goal is to choose a committee of $k$…
We show that any cooperative game can be represented by an assignment of costly facilities to players, in which it is intuitively obvious how to allocate the total cost in an equitable manner. This equitable solution turns out to be the…
We generalize the notion of minimax convergence rate. In contrast to the standard definition, we do not assume that the sample size is fixed in advance. Allowing for varying sample size results in time-robust minimax rates and estimators.…
We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…
We help Alice play a certain "convergence game" against Bob and win the prize, which is a constructive solution to a problem by Erd\H{o}s and Graham, posed in their 1980 book on open questions in combinatorial number theory. Namely, after…
We derive a representation for a lattice U(1) gauge theory with exponential convergence in the number of states used to represent each lattice site that is applicable at all values of the coupling. At large coupling, this representation is…
The aim of this work is to find a simple mathematical framework for our established description of particle physics. We demonstrate that the particular gauge structure, group representations and charge assignments of the Standard Model…
We recast move generators for solving board games as operations on compressed sets of strings. We aim for compressed representations with space sublinear in the number of game positions for interesting sets of positions, move generation in…
A large class of Positional Games are defined on the complete graph on $n$ vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his subgraph has a given -- usually monotone -- property. Here we…