Related papers: A game theoretical approximation for a parabolic/e…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
We study the problem of computing an Extensive-Form Perfect Equilibrium (EFPE) in 2-player games. This equilibrium concept refines the Nash equilibrium requiring resilience w.r.t. a specific vanishing perturbation (representing mistakes of…
This paper consider the possibility of using some quantum tools in decision making strategies. In particular, we consider here a dynamical open quantum system helping two players, $\G_1$ and $\G_2$, to take their decisions in a specific…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
In a probabilistic mean-field game driven by a linear diffusion an individual player aims to minimize an ergodic long-run cost by controlling the diffusion through a pair of -- increasing and decreasing -- c\`adl\`ag processes, while he is…
This paper extends Berge's maximum theorem for possibly noncompact action sets and unbounded cost functions to minimax problems and studies applications of these extensions to two-player zero-sum games with possibly noncompact action sets…
This paper studies two-player zero-sum repeated Bayesian games in which every player has a private type that is unknown to the other player, and the initial probability of the type of every player is publicly known. The types of players are…
Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…
Bayesian regression games are a special class of two-player general-sum Bayesian games in which the learner is partially informed about the adversary's objective through a Bayesian prior. This formulation captures the uncertainty in regard…
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,…
This paper analyses a stochastic differential game of control and stopping in which one of the players modifies a diffusion process using impulse controls, an adversary then chooses a stopping time to end the game. The paper firstly…
We consider the long-time behavior of equilibrium strategies and state trajectories in a linear quadratic $N$-player game with Gaussian initial data. By comparing the finite-horizon game with its ergodic counterpart, we establish…
In a multitime hybrid differential game with mechanical work payoff, the multitime upper value function and the multitime lower value function are viscosity solutions of original PDEs of type Hamilton-Jacobi-Isaacs.
In this paper, we consider a linear quadratic stochastic two-person zero-sum differential game. The controls for both players are allowed to appear in both drift and diffusion of the state equation. The weighting matrices in the performance…
We analyze a (possibly degenerate) second order mean field games system of partial differential equations. The distinguishing features of the model considered are (1) that it is not uniformly parabolic, including the first order case as a…
In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…
In this article, a notion of viscosity solutions is introduced for fully nonlinear second order path-dependent partial differential equations in the spirit of [Zhou, Ann. Appl. Probab., 33 (2023), 5564-5612]. We prove the existence,…
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean…
We investigate a two-player zero-sum differential game with asymmetric information on the payoff and without Isaacs condition. The dynamics is an ordinary differential equation parametrised by two controls chosen by the players. Each player…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…