Related papers: DValue for Boolean games is EXP-complete
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been…
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of…
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…
We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…
In this paper we introduce and study {\em all-pay bidding games}, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn,…
We investigate two notions of correlated equilibrium for extensive-form games: extensive-form correlated equilibrium (EFCE) and behavioral correlated equilibrium (BCE). We show that the two are outcome-equivalent, in the sense that every…
In a $3$-$\mathsf{XOR}$ game $\mathcal{G}$, the verifier samples a challenge $(x,y,z)\sim \mu$ where $\mu$ is a probability distribution over $\Sigma\times\Gamma\times\Phi$, and a map $t\colon \Sigma\times\Gamma\times\Phi\to\mathcal{A}$ for…
Two-player games on graphs provide the theoretical frame- work for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of…
Let $\gamma_g(G)$ and $\gamma_{tg}(G)$ be the game domination number and the total game domination number of a graph $G$, respectively. Then $G$ is $\gamma_g$-perfect (resp. $\gamma_{tg}$-perfect), if every induced subgraph $F$ of $G$…
We show that for any $\varepsilon>0$ there is an XOR game $G=G(\varepsilon)$ with $\Theta(\varepsilon^{-1/5})$ inputs for one player and $\Theta(\varepsilon^{-2/5})$ inputs for the other player such that $\Omega(\varepsilon^{-1/5})$ ebits…
This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. For $\omega$-regular winning conditions it is known that such games can be solved in…
Nonzero sum games typically have multiple Nash equilibriums (or no equilibrium), and unlike the zero sum case, they may have different values at different equilibriums. Instead of focusing on the existence of individual equilibriums, we…
We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game $G$ of entangled value 1-eps < 1, the value of the $k$-fold repetition of G goes to zero…
We study a class of two-player repeated games with incomplete information and informational externalities. In these games, two states are chosen at the outset, and players get private information on the pair, before engaging in repeated…
The games G_2 and G_3 are played on a complete Boolean algebra B in \omega-many moves. At the beginning White picks a non-zero element p of B and, in the n-th move, White picks a positive p_n < p and Black chooses an i_n belonging to {0,1}.…
Two-player zero-sum "graph games" are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite "play", which determines the winner or payoff of the game.…
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$…
In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their…
This paper considers an infinitely repeated three-player Bayesian game with lack of information on two sides, in which an informed player plays two zero-sum games simultaneously at each stage against two uninformed players. This is a…