Related papers: Bidding Mechanisms in Graph Games

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…

In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…

In this work, we proposed a new $N$-person game in which the players can bet on two options, for example represented by two boxers. Some of the players have privileged information about the boxers and part of them can provide this…

In an introductory paper on dollar game played on a graph, Matt Baker wrote the following: ``The total number of borrowing moves required to win the game when playing the 'borrowing binge strategy' is independent of which borrowing moves…

In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first…

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…

The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of…

Matrix games constitute a fundamental problem of game theory and describe a situation of two players with completely conflicting interests. We show how methods from statistical mechanics can be used to investigate the statistical properties…

A Dynkin game is a zero-sum, stochastic stopping game between two players where either player can stop the game at any time for an observable payoff. Typically the payoff process of the max-player is assumed to be smaller than the payoff…

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

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…

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the…

Given a graph G with positive integer weights on the vertices, and a token placed on some current vertex u, two players alternately remove a positive integer weight from u and then move the token to a new current vertex adjacent to u. When…

This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…

We consider two-player normal form games where each player has the same finite strategy set. The payoffs of each player are assumed to be i.i.d. random variables with a continuous distribution. We show that, with high probability, the…

We consider a game with two players, consisting of a number of rounds, where the first player to win $n$ rounds becomes the overall winner. Who wins each individual round is governed by a certain urn having two types of balls (type 1 and…

Stochastic two-player games model systems with an environment that is both adversarial and stochastic. The adversarial part of the environment is modeled by a player (Player 2) who tries to prevent the system (Player 1) from achieving its…

We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is…

We devise a policy-iteration algorithm for deterministic two-player discounted and mean-payoff games, that runs in polynomial time with high probability, on any input where each payoff is chosen independently from a sufficiently random…

Learning or estimating game models from data typically entails inducing separate models for each setting, even if the games are parametrically related. In empirical mechanism design, for example, this approach requires learning a new game…