Related papers: Existence and structure of Nash equilibria for sup…
Finite objects and more specifically finite games are formalized using induction, whereas infinite objects are formalized using coinduction. In this article, after an introduction to the concept of coinduction, we revisit on infinite…
We give a geometric approach to proving know regularity and existence theorems for the 2D Navier-Stokes Equations. We feel this point of view is instructive in better understanding the dynamics. The technique is inspired by constructions in…
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…
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…
In this paper we study second order master equations arising from mean field games with common noise over arbitrary time duration. A classical solution typically requires the monotonicity condition (or small time duration) and sufficiently…
We consider an algorithmic framework for two-player non-zero-sum semidefinite games, where each player's strategy is a positive semidefinite matrix with trace one. We formulate the computation of Nash equilibria in such games as…
Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both…
We consider the problem of approximating Nash equilibria of $N$ functions $f_1,\dots, f_N$ of $N$ variables. In particular, we deduce conditions under which systems of the form $$ \dot u_j(t)=-\nabla_{x_j}f_j(u(t)) $$ $(j=1,\dots, N)$ are…
We introduce and motivate the study of hypergraphical clustering games of mis-coordination. For two specific variants we prove the existence of a pure Nash equilibrium and provide bounds on the price of anarchy as a function of the…
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those correlated equilibria in which players' strategy choices are conditionally independently and identically distributed given some hidden…
The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two…
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we…
In recent and past works, convexity is usually assumed on each individual part of the action functional in order to demonstrate the existence and uniqueness of a Nash equilibrium on some interval [0, T] (this meant that each hessian was…
We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…
In this Reply I present some arguments in favor of the stability of the topological defect composed by global and magnetic monopoles.
We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…
We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation games. Our results improve previous ones by Bhalgat et al.~(EC…
We prove a topological stability result for the actions of hyperbolic groups on their Bowditch boundaries. More precisely, we show that a sufficiently small perturbation of the standard boundary action, if assumed on each parabolic subgroup…
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 compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with pre-fixed structure. Using this representation, we show conditions under which a game has the maximum possible number of this…