Multi-Agent Reinforcement Learning in Cournot Games
In this work, we study the interaction of strategic agents in continuous action Cournot games with limited information feedback. Cournot game is the essential market model for many socio-economic systems where agents learn and compete without the full knowledge of the system or each other. We consider the dynamics of the policy gradient algorithm, which is a widely adopted continuous control reinforcement learning algorithm, in concave Cournot games. We prove the convergence of policy gradient dynamics to the Nash equilibrium when the price function is linear or the number of agents is two. This is the first result (to the best of our knowledge) on the convergence property of learning algorithms with continuous action spaces that do not fall in the no-regret class.
Code (0)
등록된 구현이 없습니다.
Tasks
continuous-controlContinuous ControlMulti-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand
Many past attempts at modeling repeated Cournot games assume that demand is stationary. This does not align with real-world scenarios in which market demands can evolve over a product's lifetime for a myriad of reasons. …
Efficient ExplorationModelling Cournot Games as Multi-agent Multi-armed Bandits
We investigate the use of a multi-agent multi-armed bandit (MA-MAB) setting for modeling repeated Cournot oligopoly games, where the firms acting as agents choose from the set of arms representing production quantity (a …
Multi-Armed BanditsOn the Oscillations in Cournot Games with Best Response Strategies
In this paper, we consider the dynamic oscillation in the Cournot oligopoly model, which involves multiple firms producing homogeneous products. To explore the oscillation under the updates of best response strategies, w…
Gradient-Tracking over Directed Graphs for solving Leaderless Multi-Cluster Games
We are concerned with finding Nash Equilibria in agent-based multi-cluster games, where agents are separated into distinct clusters. While the agents inside each cluster collaborate to achieve a common goal, the clusters…
Distributed OptimizationA Zeroth-Order Momentum Method for Risk-Averse Online Convex Games
We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at ris…