Related papers: Graphical Models for Game Theory
Conventional game theory assumes that players are perfectly rational. In a realistic situation, however, players are rarely perfectly rational. This bounded rationality is one of the main reasons why the predictions of Nash equilibrium in…
We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks $G_1$ and $G_2$ in order to maximize certain local utility functions. In this setting, each…
We study a subclass of $n$-player stochastic games, namely, stochastic games with independent chains and unknown transition matrices. In this class of games, players control their own internal Markov chains whose transitions do not depend…
In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…
Dynamic nonzero sum games are widely used to model multi agent decision making in control, economics, and related fields. Classical methods for computing Nash equilibria, especially in linear quadratic settings, rely on strong structural…
In this paper, we study a theoretical math problem of game theory and calculus of variations in which we minimize a functional involving two players. A general relationship between the optimal strategies for both players is presented,…
We consider a system of single- or double integrator agents playing a generalized Nash game over a network, in a partial-information scenario. We address the generalized Nash equilibrium seeking problem by designing a fully-distributed…
One key in real-life Nash equilibrium applications is to calibrate players' cost functions. To leverage the approximation ability of neural networks, we proposed a general framework for optimizing and learning Nash equilibrium using neural…
We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…
We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game. A…
Distributed Nash equilibrium (NE) seeking problem for multi-coalition games has attracted increasing attention in recent years, but the research mainly focuses on the case without agreement demand within coalitions. This paper considers a…
Generalized Nash equilibrium (GNE) is a solution concept for complete information games, in which each player's objective function and feasible region depend on other players' actions. While numerical methods for finding GNE when players…
In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each…
In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…
The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency…
In this paper, we solve the problem of learning a generalized Nash equilibrium (GNE) in merely monotone games. First, we propose a novel continuous semi-decentralized solution algorithm without projections that uses first-order information…
We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…
We consider the problem of computing mixed Nash equilibria of two-player zero-sum games with continuous sets of pure strategies and with first-order access to the payoff function. This problem arises for example in game-theory-inspired…
For the classical backward induction algorithm, the input is an arbitrary $n$-person positional game with perfect information modeled by a finite acyclic directed graph (digraph) and the output is a profile $(x_1, \ldots, x_n)$ of pure…
We design the first fully-distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the agents have no direct access to the…