Related papers: Conditional Expectation of Banach Valued Correspon…
We derive the rate of convergence to the strongly variationally stable Nash equilibrium in a convex game, for a zeroth-order learning algorithm. Though we do not assume strong monotonicity of the game, our rates for the one-point feedback…
Kuhn-Tucker conditions for mathematical programming problems in Banach spaces partially ordered by cone with empty interior are obtained under strong simultaneity condition. If partial ordered cone has interior point, it is proved that…
We use vector bundles to study the locus of totally mixed Nash equilibria of an $n$-player game in normal form, which we call the Nash equilibrium scheme. When the payoff tensor format is balanced, we study the Nash discriminant variety,…
In this paper, we investigate under which conditions normal-form games are (guaranteed to be) strategically equivalent. First, we show for N-player games (N >= 3) that (A) it is NP-hard to decide whether a given strategy is a best response…
Nonlinear higher order difference equations with linear arguments (containing linear forms within nonlinear maps of the space) are well-defined on Banach algebras. The scalar forms of these equations (i.e., with real variables and…
In this paper, we consider Mean Field Games in the presence of common noise relaxing the usual independence assumption of individual random noise. We assume a simple linear model with terminal cost satisfying a convexity and a weak…
A nonempty closed convex bounded subset $C$ of a Banach space is said to have the weak approximate fixed point property if for every continuous map $f:C\to C$ there is a sequence $\{x_n\}$ in $C$ such that $x_n-f(x_n)$ converge weakly to 0.…
Nash equilibrium (NE) is a central concept in game theory. Here we prove formally a published theorem on existence of an NE in two proof assistants, Coq and Isabelle: starting from a game with finitely many outcomes, one may derive a game…
We introduce and study a mean-field model for a system of spatially distributed players interacting through an evolutionary game driven by a replicator dynamics. Strategies evolve by a replicator dynamics influenced by the position and the…
In this note we provide a self-contained proof of an existence and uniqueness result for a class of Banach space valued evolution equations with an additive forcing term. The framework of our abstract result includes, for example, finite…
Noncooperative games with uncertain payoffs have been classically studied under the expected-utility theory framework, which relies on the strong assumption that agents behave rationally. However, simple experiments on human decision makers…
We consider payoff-based learning of a generalized Nash equilibrium (GNE) in multi-agent systems. Our focus is on games with jointly convex constraints of a linear structure and strongly monotone pseudo-gradients. We present a convergent…
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer…
Various social contexts ranging from public goods provision to information collection can be depicted as games of strategic interactions, where a player's well-being depends on her own action as well as on the actions taken by her…
In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available…
We introduce a new algorithm for the numerical computation of Nash equilibria of competitive two-player games. Our method is a natural generalization of gradient descent to the two-player setting where the update is given by the Nash…
The betweenness property of preference relations states that a probability mixture of two lotteries should lie between them in preference. It is a weakened form of the independence property and hence satisfied in expected utility theory…
We consider a class of Wasserstein distributionally robust Nash equilibrium problems, where agents construct heterogeneous data-driven Wasserstein ambiguity sets using private samples and radii, in line with their individual risk-averse…
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…
We add here another layer to the literature on nonatomic anonymous games started with the 1973 paper by Schmeidler. More specifically, we define a new notion of equilibrium which we call $\varepsilon$-estimated equilibrium and prove its…