Related papers: Semi-restricted Rock, Paper, Scissors

Spiro, Surya and Zeng (Electron. J. Combin. 2023; arXiv:2207.11272) recently studied a semi-restricted variant of the well-known game Rock, Paper, Scissors; in this variant the game is played for $3n$ rounds, but one of the two players is…

This paper analyzes Shinohara Rock-Paper-Scissors (RPS), a variant of the classic RPS game introduced by board game designer Yoshiteru Shinohara. Players compete against a host who always plays rock, so players choose either rock or paper.…

Classic Rock-Paper-Scissors, RPS, has seen many variants and generalizations in the past several years. In the previous paper, we defined playability and balance for games. We used these definitions to show that different forms of imbalance…

The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…

Rock-Paper-Scissors (RPS), a game of cyclic dominance, is not merely a popular children's game but also a basic model system for studying decision-making in non-cooperative strategic interactions. Aimed at students of physics with no…

In an iterated non-cooperative game, if all the players act to maximize their individual accumulated payoff, the system as a whole usually converges to a Nash equilibrium that poorly benefits any player. Here we show that such an…

We generalize Rock Paper Scissors to complete directed graphs, or tournaments, on $n$ vertices. Properties of the mixed-strategy Nash equilibria of these tournaments are discussed, particularly those with Nash equilibria where all of the…

In a two-person Rock-Paper-Scissors (RPS) game, if we set a loss worth nothing and a tie worth 1, and the payoff of winning (the incentive a) as a variable, this game is called as generalized RPS game. The generalized RPS game is a…

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously…

Predicting and modeling human behavior and finding trends within human decision-making processes is a major problem of social science. Rock Paper Scissors (RPS) is the fundamental strategic question in many game theory problems and…

How humans make decisions in non-cooperative strategic interactions is a challenging question. For the fundamental model system of Rock-Paper-Scissors (RPS) game, classic game theory of infinite rationality predicts the Nash equilibrium…

The Rock-Paper-Scissors (RPS) game is a widely used model system in game theory. Evolutionary game theory predicts the existence of persistent cycles in the evolutionary trajectories of the RPS game, but experimental evidence has remained…

The restricted $(m,n;N)$-online Ramsey game is a game played between two players, Builder and Painter. The game starts with $N$ isolated vertices. Each turn Builder picks an edge to build and Painter chooses whether that edge is red or…

The Rock-Paper-Scissors (RPS) game is a classic non-cooperative game widely studied in terms of its theoretical analysis as well as in its applications, ranging from sociology and biology to economics. Many experimental results of the RPS…

We consider the one-round Voronoi game, where player one (``White'', called ``Wilma'') places a set of n points in a rectangular area of aspect ratio r <=1, followed by the second player (``Black'', called ``Barney''), who places the same…

Social dilemmas concern a natural conflict between cooperation and self interests among individuals in large populations. The emergence of cooperation and its maintenance is the key for the understanding of fundamental concepts about the…

We consider various probabilistic games with piles for one player or two players. In each round of the game, a player randomly chooses to add $a$ or $b$ chips to his pile under the condition that $a$ and $b$ are not necessarily positive. If…

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…

Consider the following probabilistic one-player game: The board is a graph with $n$ vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at random from all non-edges and is presented to the player,…

Progress in fields of machine learning and adversarial planning has benefited significantly from benchmark domains, from checkers and the classic UCI data sets to Go and Diplomacy. In sequential decision-making, agent evaluation has largely…