Related papers: From bocce to positivity: some probabilistic linea…
Spontaneous symmetry breaking is a fundamental notion in modern physics, ranging from high energy to condensed matter. However, the usual spontaneous symmetry breaking only considers the equal probability to select the vacua. In this work,…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are…
Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…
In this work we propose a kinetic formulation for evolutionary game theory for zero sum games when the agents use mixed strategies. We start with a simple adaptive rule, where after an encounter each agent increases the probability of play…
We prove an interesting fact about Lottery: the winning 6 numbers (out of 49) in the game of the Lottery contain two consecutive numbers with a surprisingly high probability (almost 50%).
The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…
Ball sort puzzle is a popular logic puzzle consisting of several bins containing balls of multiple colors. Each bin works like a stack; a ball has to follow the last-in first-out order. The player has to sort the balls by color such that…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
In this paper we find viscosity solutions to the two membranes problem (that is a system with two obstacle-type equations) with two different $p-$Laplacian operators taking limits of value functions of a sequence of games. We analyze…
Balls-in-bins models describe a random sequential allocation of infinitely many balls into a finite number of bins. In these models a ball is placed into a bin with probability proportional to a given function (feedback function), which…
This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a…
We consider a setting in which a principal gets to choose which game from some given set is played by a group of agents. The principal would like to choose a game that favors one of the players, the social preferences of the players, or the…
Zero-sum stochastic games provide a rich model for competitive decision making. However, under general forms of state uncertainty as considered in the Partially Observable Stochastic Game (POSG), such decision making problems are still not…
We improve some ancient results of Velickovic on the cut and choose (c&c) game on complete Boolean algebras. (1) If Nonempty has a winning strategy for c&c game on $B$ then $B$ is semiproper. (2) If Nonempty has a winning strategy and $B$…
We discuss individual components of the college football Bowl Championship Series, compare with a simple algorithm defined by random walks on a biased graph, attempt to predict whether the proposed changes will truly lead to increased BCS…
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already solved, given general results in game theory. However, the…
Suppose an interval is put on a horizontal line with random roughness. With probability one it is supported at two points, one from the left, and another from the right from its center. We compute probability distribution of support points…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
Richman games are zero-sum games, where in each turn players bid in order to determine who will play next [Lazarus et al.'99]. We extend the theory to impartial general-sum two player games called \emph{bidding games}, showing the existence…