Related papers: Statics and dynamics of selfish interactions in di…
We consider the provision of public goods on networks of strategic agents. We study different effort outcomes of these network games, namely, the Nash equilibria, Pareto efficient effort profiles, and semi-cooperative equilibria (effort…
Covering and packing problems can be modeled as games to encapsulate interesting social and engineering settings. These games have a high Price of Anarchy in their natural formulation. However, existing research applicable to specific…
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a desired outcome (if it is tractable) and impose it. However…
Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…
In this letter, we study distributed optimization and Nash equilibrium-seeking dynamics from a contraction theoretic perspective. Our first result is a novel bound on the logarithmic norm of saddle matrices. Second, for distributed gradient…
Auctions are modeled as Bayesian games with continuous type and action spaces. Determining equilibria in auction games is computationally hard in general and no exact solution theory is known. We introduce an algorithmic framework in which…
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…
Individual behaviors play an essential role in the dynamics of transmission of infectious diseases, including COVID--19. This paper studies a dynamic game model that describes the social distancing behaviors during an epidemic, assuming a…
In the traditional game-theoretic set up, where agents select actions and experience corresponding utilities, an equilibrium is a configuration where no agent can improve their utility by unilaterally switching to a different action. In…
This paper addresses a class of network games played by dynamic agents using their outputs. Unlike most existing related works, the Nash equilibrium in this work is defined by functions of agent outputs instead of full agent states, which…
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that…
We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on…
We consider two-player normal form games where each player has the same finite strategy set. The payoffs of each player are assumed to be i.i.d. random variables with a continuous distribution. We show that, with high probability, the…
We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on…
We investigate the convergence of symmetric stochastic differential games with interactions via control, where the volatility terms of both idiosyncratic and common noises are controlled. We apply the stochastic maximum principle, following…
In multi-agent autonomous systems, deception is a fundamental concept which characterizes the exploitation of unbalanced information to mislead victims into choosing oblivious actions. This effectively alters the system's long term…
To what extent does the structure of the players' strategy space influence the efficiency of decentralized solutions in congestion games? In this work, we investigate whether better performance are possible when restricting to load…
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…
A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information…
We discuss long-run behavior of stochastic dynamics of many interacting agents. In particular, three-player spatial games are studied. The effect of the number of players and the noise level on the stochastic stability of Nash equilibria is…