Related papers: Dynamics to equilibrium in Network Games: individu…

In this paper, we investigate the seeking of Nash equilibrium (NE) in a non-cooperative quadratic game where all agents exchange their delayed strategy information with their neighbors. To extend best-response algorithms to the delayed…

Multi-agent games are becoming an increasing prevalent formalism for the study of electronic commerce and auctions. The speed at which transactions can take place and the growing complexity of electronic marketplaces makes the study of…

Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…

In real-world social systems, individual interactions are frequently shaped by reputation, which not only influences partner selection but also affects the nature and benefits of the interactions themselves. We propose a heterogeneous game…

In this work, we introduce graphical modelsfor multi-player game theory, and give powerful algorithms for computing their Nash equilibria in certain cases. An n-player game is given by an undirected graph on n nodes and a set of n local…

Modern socio-technical systems typically consist of many interconnected users and competing service providers, where notions like market equilibrium are tightly connected to the ``evolution'' of the network of users. In this paper, we model…

In single-agent Markov decision processes, an agent can optimize its policy based on the interaction with environment. In multi-player Markov games (MGs), however, the interaction is non-stationary due to the behaviors of other players, so…

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…

Many important real-world settings contain multiple players interacting over an unknown duration with probabilistic state transitions, and are naturally modeled as stochastic games. Prior research on algorithms for stochastic games has…

If a game has a unique Nash equilibrium, then this equilibrium is arguably the solution of the game from the refinement's literature point of view. However, it might be that for almost all initial conditions, all strategies in the support…

The finitely repeated Prisoners' Dilemma is a good illustration of the discrepancy between the strategic behaviour suggested by a game-theoretic analysis and the behaviour often observed among human players, where cooperation is maintained…

The rise in online social networking has brought about a revolution in social relations. However, its effects on offline interactions and its implications for collective well-being are still not clear and are under-investigated. We study…

We study the connection between the evolutionary replicator dynamics and the number of Nash equilibria in large random bi-matrix games. Using techniques of disordered systems theory we compute the statistical properties of both, the fixed…

This study investigates differential games with motion-payoff uncertainty in continuous-time settings. We propose a framework where players update their beliefs about uncertain parameters using continuous Bayesian updating. Theoretical…

This paper develops a distributed resource allocation game to study countries' pursuit of targets such as self-survival in the networked international environment. The contributions are two. First, the game formalizes countries' power…

We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure Nash equilibria arising when random…

We consider the basic problem of approximating Nash equilibria in noncooperative games. For monotone games, we design continuous time flows which converge in an averaged sense to Nash equilibria. We also study mean field equilibria, which…

In the theory of multi-agent systems, deception refers to the strategic manipulation of information to influence the behavior of other agents, ultimately altering the long-term dynamics of the entire system. Recently, this concept has been…

Motivated by the scarcity of accurate payoff feedback in practical applications of game theory, we examine a class of learning dynamics where players adjust their choices based on past payoff observations that are subject to noise and…

Learning in zero-sum games studies a situation where multiple agents competitively learn their strategy. In such multi-agent learning, we often see that the strategies cycle around their optimum, i.e., Nash equilibrium. When a game…