Related papers: A game generalizing Hall's theorem
In a recent paper, Dousse introduced a refinement of Siladi\'c's theorem on partitions, where parts occur in two primary and three secondary colors. Her proof used the method of weighted words and $q$-difference equations. The purpose of…
A simple but nontrivial class of the quantum strategies in buying-selling games is presented. The player moves are a rational buying and an unconditional selling. The possibility of gaining extremal profits in such the games is considered.…
We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and an- other with a payoff dependent on others' selected actions. This…
At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…
We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial…
In this paper we consider symmetric games where a large number of players can be in any one of d states. We derive a limiting mean field model and characterize its main properties. This mean field limit is a system of coupled ordinary…
In this work we consider an agent based model in order to study the wealth distribution problem where the interchange is determined with a symmetric zero sum game. Simultaneously, the agents update their way of play trying to learn the…
We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…
We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…
The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a graph with $n$ vertices and maximum degree $\Delta$. The game…
Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of…
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are…
The domination game is played on a graph $G$ by two players, named Dominator and Staller. They alternatively select vertices of $G$ such that each chosen vertex enlarges the set of vertices dominated before the move on it. Dominator's goal…
We give topological and game theoretic definitions and theorems nec- essary for defining a Banach-Mazur game, and apply these definitions to formalize the game. We then state and prove two theorems which give necessary conditions for…
We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set…
In this paper we introduce novel algorithmic strategies for effciently playing two-player games in which the players have different or identical player roles. In the case of identical roles, the players compete for the same objective (that…
We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to…
We discuss winning possibilities of players in various variants of cops and robber game played on large random graphs, a testbed for various kinds of network queries, search problems in particular. We explore the use of logic frameworks to…
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vertex is the winner. The game fits into the scheme of several…
In this paper, we present betting strategy of a football game using probability theory. We know all betting houses offer slightly unfair odds towards the player. Here we discuss a simple way to figure out which betting house is offering…