Related papers: Allocating marketing resources over social network…
In recent years, data has played an increasingly important role in the economy as a good in its own right. In many settings, data aggregators cannot directly verify the quality of the data they purchase, nor the effort exerted by data…
In this paper, we present a framework for multi-agent learning in a nonstationary dynamic network environment. More specifically, we examine projected gradient play in smooth monotone repeated network games in which the agents'…
We consider the scenario where $N$ utilities strategically bid for electricity in the day-ahead market and balance the mismatch between the committed supply and actual demand in the real-time market, with uncertainty in demand and local…
This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…
We consider a sharing economy network where agents embedded in a graph share their resources. This is a fundamental model that abstracts numerous emerging applications of collaborative consumption systems. The agents generate a random…
This work is dedicated to the algorithm design in a competitive framework, with the primary goal of learning a stable equilibrium. We consider the dynamic price competition between two firms operating within an opaque marketplace, where…
We study the asymptotic behavior of deterministic, continuous-time imitation dynamics for population games over networks. The basic assumption of this learning mechanism -- encompassing the replicator dynamics -- is that players belonging…
We consider the Nash equilibrium problem in a partial-decision information scenario. Specifically, each agent can only receive information from some neighbors via a communication network, while its cost function depends on the strategies of…
I propose a flexible structural model to estimate peer effects across various quantiles of the peer outcome distribution. The model allows peers with low, intermediate, and high outcomes to exert distinct influences, thereby capturing more…
We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at…
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…
The rapid increase of photovoltaic cells, batteries, and Electric Vehicles (EVs) in electric grids can result in congested distribution networks. An alternative to enhancing network capacity is a redispatch market, allowing Distribution…
We introduce a new approach to the study of influence in strategic settings where the action of an individual depends on that of others in a network-structured way. We propose \emph{influence games} as a \emph{game-theoretic} model of the…
Can noncooperative behaviour of merchants lead to a market split that prima facie seems anticompetitive? We introduce a model in which service providers, with ISPs being the main example, aim at optimizing the number of customers using…
Viral marketing takes advantage of preexisting social networks among customers to achieve large changes in behaviour. Models of influence spread have been studied in a number of domains, including the effect of "word of mouth" in the…
In communication systems where users share common resources, users' selfish behavior usually results in suboptimal resource utilization. There have been extensive works that model communication systems with selfish users as one-shot games…
We study optimal behavior of energy producers under a CO_2 emission abatement program. We focus on a two-player discrete-time model where each producer is sequentially optimizing her emission and production schedules. The game-theoretic…
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…
Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…
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…