Related papers: Meta-Bayesian Nash Equilibrium: Existence via Kaku…

This paper focuses on finite-player incomplete information games where players may hold mutually inconsistent beliefs without a common prior. We introduce absolute continuity of beliefs, extending the classical notion of absolutely…

We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…

A systematic theory is introduced that describes stochastic effects in game theory. In a biological context, such effects are relevant for the evolution of finite populations with frequency-dependent selection. They are characterized by…

Claude Shannon's zero-error communication paradigm reshaped our understanding of fault-tolerant information transfer. Here, we adapt this notion into game theory with incomplete information. We ask: can players with private information…

This paper is devoted to Nash equilibrium for games in capacities. Such games with payoff expressed by Choquet integral were considered by Kozhan and Zarichnyi (Nash equilibria for games in capacities, Econ. Theory {\bf 35} (2008) 321--331)…

We study stochastic mean-field games among finite number of teams with large finite as well as infinite number of decision makers. For this class of games within static and dynamic settings, we establish the existence of a Nash equilibrium,…

Following the ideas laid out in Myerson (1996), Hofbauer (2000) defined a Nash equilibrium of a finite game as sustainable if it can be made the unique Nash equilibrium of a game obtained by deleting/adding a subset of the strategies that…

Concurrent multi-player games with $\omega$-regular objectives are a standard model for systems that consist of several interacting components, each with its own objective. The standard solution concept for such games is Nash Equilibrium,…

We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model…

This paper analyses two-player nonzero-sum games of optimal stopping on a class of linear regular diffusions with not non-singular boundary behaviour (in the sense of It\^o and McKean (1974), p.\ 108). We provide sufficient conditions under…

This paper introduces a performative scenario optimization framework for decision-dependent chance-constrained problems. Unlike classical stochastic optimization, we account for the feedback loop where decisions actively shape the…

In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an…

The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to…

This paper introduces risk-revising players to a class of games with incomplete information. These players enter the game with ex ante risk preferences represented by coherent risk measures and develop time-consistent interim revisions of…

Algorithms for computing game-theoretic solutions have recently been applied to a number of security domains. However, many of the techniques developed for compact representations of security games do not extend to {\em Bayesian} security…

Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an…

We consider a nonzero-sum N-player Markov game on an abstract measurable state space with compact metric action spaces. The payoff functions are bounded Carath\'eodory functions and the transitions of the system are assumed to have a…

We study the existence and computation of Nash equilibria in concave games where the players' admissible strategies are subject to shared coupling constraints. Under playerwise concavity of constraints, we prove existence of Nash…

In evolutionary game theory, it is customary to be partial to the dynamical models possessing fixed points so that they may be understood as the attainment of evolutionary stability, and hence, Nash equilibrium. Any show of periodic or…