Related papers: Equilibria in a competitive model arising from lin…
We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a…
Nash equilibria provide a principled framework for modeling interactions in multi-agent decision-making and control. However, many equilibrium-seeking methods implicitly assume that each agent has access to the other agents' objectives and…
In this paper we study variations of the standard Hotelling-Downs model of spatial competition, where each agent attracts the clients in a restricted neighborhood, each client randomly picks one attractive agent for service. Two utility…
Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work,…
Evidential cooperation in large worlds (ECL) refers to the idea that humans and other agents can benefit by cooperating with similar agents with differing values in causally disconnected parts of a large universe. Cooperating provides…
Computing Nash equilibria for strategic multi-agent systems is challenging for expensive black box systems. Motivated by the ubiquity of games involving exploitation of common resources, this paper considers the above problem for potential…
We address the problem of assessing the robustness of the equilibria in uncertain, multi-agent games. Specifically, we focus on generalized Nash equilibrium problems in aggregative form subject to linear coupling constraints affected by…
Within a common arbitrage-free semimartingale financial market we consider the problem of determining all Nash equilibrium investment strategies for $n$ agents who try to maximize the expected utility of their relative wealth. The utility…
We address Nash equilibrium problems in a partial-decision information scenario, where each agent can only exchange information with some neighbors, while its cost function possibly depends on the strategies of all agents. We characterize…
In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the…
Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control. Arguably, one of the most difficult and important tasks for which large scale networked system control is applicable is…
Mean field games (MFGs) have been introduced to study Nash equilibria in very large population of self-interested agents. However, when applied to common pool resource (CPR) games, MFG equilibria lead to the so-called tragedy of the commons…
The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some…
We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic…
This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…
This paper studies the existence of pure Nash equilibria in resource graph games, which are a general class of strategic games used to succinctly represent the players' private costs. There is a finite set of resources and the strategy set…
This paper develops a strategic model of trade between two regions in which, depending on the relation among output, financial resources and transportation costs, the adjustment of prices towards an equilibrium is studied. We derive…
We propose a generic strategic network resource sharing game between a set of players representing operators. The players negotiate which sets of players share given resources, serving users with varying sensitivity to interference. We…
We study a static game played by a finite number of agents, in which agents are assigned independent and identically distributed random types and each agent minimizes its objective function by choosing from a set of admissible actions that…
We study an N-player game where a pure action of each player is to select a non-negative function on a Polish space supporting a finite diffuse measure, subject to a finite constraint on the integral of the function. This function is used…