Related papers: Representing Strategic Games and Their Equilibria …
This paper proposes and studies a general form of dynamic $N$-player non-cooperative games called $\alpha$-potential games, where the change of a player's value function upon her unilateral deviation from her strategy is equal to the change…
This compendium features advances in Game Theory, to include: Classical Game Theory: Cooperative and non-cooperative. Zero-sum and non-zero sum games. Potential and Congestion games. Mean Field games. Nash Equilibrium, Correlated Nash…
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…
We investigate Kantian equilibria in finite normal form games, a class of non-Nashian, morally motivated courses of action that was recently proposed in the economics literature. We highlight a number of problems with such equilibria,…
Linear Dynamic Logic on finite traces LDLf is a powerful logic for reasoning about the behaviour of concurrent and multi-agent systems. In this paper, we investigate techniques for both the characterisation and verification of equilibria in…
We introduce set packing games as an abstraction of situations in which $n$ selfish players select subsets of a finite set of indivisible items, and analyze the quality of several equilibria for this class of games. Assuming that players…
We are interested in the study of stochastic games for which each player faces an optimal stopping problem. In our setting, the players may interact through the criterion to optimise as well as through their dynamics. After briefly…
We propose a new approach to mean field games with major and minor players. Our formulation involves a two player game where the optimization of the representative minor player is standard while the major player faces an optimization over…
A solution concept that is a refinement of Nash equilibria selects for each finite game a nonempty collection of closed and connected subsets of Nash equilibria as solutions. We impose three axioms for such solution concepts. The axiom of…
We prove the celebrated representation theorem of Andreka-Resek-Thompson, together with its polyadic analogue by Ferenczi, using games as introduced in algebraic logic by Hirsch and Hodkinson. We also show that atomic algebras are…
Considering infinite-horizon, discrete-time, linear quadratic, N-player dynamic games with scalar dynamics, a graphical representation of feedback Nash equilibrium solutions is provided. This representation is utilised to derive conditions…
We study a very general class of games --- multi-dimensional aggregative games --- which in particular generalize both anonymous games and weighted congestion games. For any such game that is also large, we solve the equilibrium selection…
This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that…
An axiomatic characterization of Nash equilibrium is provided for games in normal form. The Nash equilibrium correspondence is shown to be fully characterized by four simple and intuitive axioms, two of which are inspired by contraction and…
Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria…
Imperfect recall games represent dynamic interactions where players forget previously known information, such as a history of played actions. The importance of imperfect recall games stems from allowing a concise representation of…
We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the…
Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work,…
Positional games are a mathematical class of two-player games comprising Tic-tac-toe and its generalizations. We propose a novel encoding of these games into Quantified Boolean Formulas (QBFs) such that a game instance admits a winning…
The standard game-theoretic solution concept, Nash equilibrium, assumes that all players behave rationally. If we follow a Nash equilibrium and opponents are irrational (or follow strategies from a different Nash equilibrium), then we may…