相关论文: Generalizations of the M&M Game

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives…

The Warden's Game is a 2-player game, played with a row of coins. One player (the prisoner) wants to get all coins to show tails; the other player (the warden) wants to delay that as long as possible. At each turn, one player transfers the…

A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$…

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,…

A finite impartial game is a two-player game in which the players take turns making moves and the game ends after finitely many moves. In this paper, we study a class of finite impartial games introduced by H.~Lenstra, which we call coin…

In a Maker-Breaker game on a graph $G$, Breaker and Maker alternately claim edges of $G$. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games…

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to…

Finding a counterfeit coin with the different weight from a set of visually identical coin using a balance, usually a two-armed balance, known as the balance question, is an intersting and inspiring question. Its variants involve…

In the game of Graph Nimors, two players alternately perform graph minor operations (deletion and contraction of edges) on a graph until no edges remain, at which point the player who last moved wins. We present theoretical and experimental…

This paper analyzes a simple game with $n$ players. We fix a mean, $\mu$, in the interval $[0, 1]$ and let each player choose any random variable distributed on that interval with the given mean. The winner of the zero-sum game is the…

You play the following game: you start out with $n$ coins that all have probability $p$ to land heads. You toss all of them and you then need to set aside at least one of them, which will not be tossed again. Now you repeat the process with…

Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says "Heads" or "Tails". The team wins if all four choices match; otherwise the Devil wins. If all team…

We consider the following game. A deck with $m$ copies of each of $n$ distinct cards is shuffled in a perfectly random way. The Guesser sequentially guesses the card from top to bottom. After each guess, the Guesser is informed whether the…

We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with…

In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the…

This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catch the man while the man tries to evade capture. We are…

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…

The online Ramsey turnaround game is a game between two players, Builder and Painter, on a board of $n$ vertices using $3$ colors, for a fixed graph $H$ on at most $n$ vertices. The goal of Painter is to force a monochromatic copy of $H$,…

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…