Related papers: On a continuous Gale--Berlekamp switching game

In this work we propose and develop modified quantum games (zero and non-zero sum) in which payoffs and strategies are entangled. For the games studied, Nash and Pareto equilibriums are always obtained indicating that there are some…

The semigroup game is a two-person zero-sum game defined on a semigroup S as follows: Players 1 and 2 choose elements x and y in S, respectively, and player 1 receives a payoff f(xy) defined by a function f from S to [-1,1]. If the…

In this paper we unify, simplify, and extend previous work on the evolutionary dynamics of symmetric $N$-player matrix games with two pure strategies. In such games, gains from switching strategies depend, in general, on how many other…

Prior work has studied the computational complexity of computing optimal strategies to commit to in Stackelberg or leadership games, where a leader commits to a strategy which is observed by one or more followers. We extend this setting to…

The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in $NP \cap coNP$ which are not known to be in $P$. However, there are some…

Stackelberg Games are gaining importance in the last years due to the raise of Adversarial Machine Learning (AML). Within this context, a new paradigm must be faced: in classical game theory, intervening agents were humans whose decisions…

In this article, a game-theoretic model is constructed that is related to the problem of optimal assignments. Examples are considered. A compromise point is found, the Nash equilibriums and the decision of the Nash arbitration scheme are…

We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.

We provide a polynomial algorithm to find the value and an optimal strategy for a generalization of the Pig game. Modeled as a competitive Markov decision process, the corresponding Bellman equations can be decoupled leading to systems of…

We study generalized games defined over Banach spaces using variational analysis. To reformulate generalized games as quasi-variational inequality problems, we will first form a suitable principal operator and study some significant…

A new mathematical model for evolutionary games on graphs is proposed to extend the classical replicator equation to finite populations of players organized on a network with generic topology. Classical results from game theory,…

This paper introduces a class of continuous-time, finite-player stochastic general-sum differential games that admit solutions through an exact linear PDE system. We formulate a distribution planning game utilizing the cross-log-likelihood…

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…

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…

Evolutionary game theory is a framework to formalize the evolution of collectives ("populations") of competing agents that are playing a game and, after every round, update their strategies to maximize individual payoffs. There are two…

We use the indirect evolutionary approach to study evolutionarily stable preferences against multiple mutations in single- and multi-population matching settings, respectively. Players choose strategies to maximize their subjective…

We study mean field games and corresponding $N$-player games in continuous time over a finite time horizon where the position of each agent belongs to a finite state space. As opposed to previous works on finite state mean field games, we…

Here, we prove the existence of solutions to first-order mean-field games (MFGs) arising in optimal switching. First, we use the penalization method to construct approximate solutions. Then, we prove uniform estimates for the penalized…

In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed…

A matrix-based framework for Bayesian games is presented, using semi-tensor product of matrices. Static Bayesian games are considered first. Matrix expression of Bayesian games is proposed. Three kinds of conversions, which convert Bayesian…