Related papers: Conditional Expectations of Correspondences
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine…
We investigate the set of Nash equilibrium payoffs for two person differential games. The main result of the paper is the characterization of the set of Nash equilibrium payoffs in the terms of nonsmooth analysis. Also we obtain the…
Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the risk that the solutions we compute are not robust to errors in this specification. Ordinal games provide an attractive alternative: they require…
We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from…
In this paper we explore relaxations of (Williams) coherent and convex conditional previsions that form the families of $n$-coherent and $n$-convex conditional previsions, at the varying of $n$. We investigate which such previsions are the…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
This paper focuses on linear-quadratic (LQ for short) mean-field games described by forward-backward stochastic differential equations (FBSDEs for short), in which the individual control region is postulated to be convex. The decentralized…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
We study which outcomes are implementable by disclosing coarse statistics of a data-generating process rather than its full distribution. Players observe data whose joint distribution is only partially known: they know the expectations of…
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil's Extended Argumentation Frameworks.…
We analyze a continuous time multidimensional opinion model where agents have heterogeneous but symmetric and compactly supported interaction functions. We consider Filippov solutions of the resulting dynamics and show strong Lyapunov…
Our paper addresses characterizing conditions for a linear quadratic (LQ) game to be a potential game. The desired properties of potential games in finite action settings, such as convergence of learning dynamics to Nash equilibria, and the…
In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning…
This paper examines strategic trading under incomplete information, where firms lack full knowledge of key aspects of their competitors' trading strategies such as target sizes and market impact models. We extend previous work on…
In this paper we survey various notions of anonymity and symmetry for finite strategic-form games present in relevant literature, and discuss notions of fairness; show that game bijections and game isomorphisms form groupoids; introduce…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
We obtain an elementary characterization of expected utility based on a representation of choice in terms of psychological gambles, which requires no assumption other than coherence between ex-ante and ex-post preferences. Weaker version of…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
Capacitated network bargaining games are popular combinatorial games that involve the structure of matchings in graphs. We show that it is always possible to stabilize unit-weight instances of this problem (that is, ensure that they admit a…
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…