相关论文: A Natural Dynamics for Bargaining on Exchange Netw…

A noncooperative differential (dynamic) game model of opinion dynamics is proposed. In this game, the agents' motives are shaped by their expectations of the nature of others' opinions as well as how susceptible they are to get influenced…

This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce…

We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given…

We consider multi-agent decision making, where each agent optimizes its cost function subject to constraints. Agents' actions belong to a compact convex Euclidean space and the agents' cost functions are coupled. We propose a distributed…

In practical applications, decision-makers with heterogeneous dynamics may be engaged in the same decision-making process. This motivates us to study distributed Nash equilibrium seeking for games in which players are mixed-order (first-…

Consensus formation in a social network is modeled by a dynamic game of a prescribed duration played by members of the network. Each member independently minimizes a cost function that represents his/her motive. An integral cost function…

In this paper, the user association and resource allocation problem is investigated for a two-tier HetNet consisting of one macro Base Station (BS) and a number of pico BSs. The effectiveness of user association to BSs is evaluated in terms…

We construct Nash equilibria in feedback form for a class of two-person stochastic games of singular control with absorption, arising from a stylized model for corporate finance. More precisely, the paper focusses on a strategic dynamic…

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…

In this paper we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information. We start from a continuous-time gradient-play dynamics that converges to an NE…

A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to…

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear…

This paper presents a new distributed algorithm that leverages heavy-ball momentum and a consensus-based gradient method to find a Nash equilibrium (NE) in a class of non-cooperative convex games with unconstrained action sets. In this…

We consider bargaining problems which involve two participants, with a nonempty closed, bounded convex bargaining set of points in the real plane representing all realizable bargains. We also assume that there is no definite threat or…

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users…

We study a network extension to the Nash bargaining game, as introduced by Kleinberg and Tardos (STOC'08), where the set of players corresponds to vertices in a graph $G=(V,E)$ and each edge $ij\in E$ represents a possible deal between…

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 address the Nash equilibrium problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost possibly depends on the strategies of other agents. Our main contribution is…

Kleinberg proposed a family of small-world networks to explain the navigability of large-scale real-world social networks. However, the underlying mechanism that drives real networks to be navigable is not yet well understood. In this…

Continuous-time gradient-based Nash equilibrium seeking algorithms enjoy a passivity property under a suitable monotonicity assumption. This feature has been exploited to design distributed algorithms that converge to Nash equilibria and…