paper-with-me

Papers

Environment Complexity and Nash Equilibria in a Sequential Social Dilemma

2024-08-04 · Mustafa Yasir, Andrew Howes, Vasilios Mavroudis, Chris Hicks

Multi-agent reinforcement learning (MARL) methods, while effective in zero-sum or positive-sum games, often yield suboptimal outcomes in general-sum games where cooperation is essential for achieving globally optimal outcomes. Matrix game social dilemmas, which abstract key aspects of general-sum interactions, such as cooperation, risk, and trust, fail to model the temporal and spatial dynamics characteristic of real-world scenarios. In response, our study extends matrix game social dilemmas into more complex, higher-dimensional MARL environments. We adapt a gridworld implementation of the Stag Hunt dilemma to more closely match the decision-space of a one-shot matrix game while also introducing variable environment complexity. Our findings indicate that as complexity increases, MARL agents trained in these environments converge to suboptimal strategies, consistent with the risk-dominant Nash equilibria strategies found in matrix games. Our work highlights the impact of environment complexity on achieving optimal outcomes in higher-dimensional game-theoretic MARL environments.

📄 PDF Abstract BibTeX arXiv:2408.02148

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-agent Reinforcement Learning

Similar Papers 제목 키워드 기반

On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games

2019-01-03 · Eric V. Mazumdar, Michael. I. Jordan, S. Shankar Sastry

We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local N…

Generative Adversarial Network

Decentralized Policy Gradient for Nash Equilibria Learning of General-sum Stochastic Games

2022-10-14 · Yan Chen, Tao Li

We study Nash equilibria learning of a general-sum stochastic game with an unknown transition probability density function. Agents take actions at the current environment state and their joint action influences the trans…

Smooth Nash Equilibria: Algorithms and Complexity

2023-09-21 · Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty

A fundamental shortcoming of the concept of Nash equilibrium is its computational intractability: approximating Nash equilibria in normal-form games is PPAD-hard. In this paper, inspired by the ideas of smoothed analysis…

Fast computation of Nash Equilibria in Imperfect Information Games

2020-01-01 · ICML 2020 1 · Remi Munos, Julien Perolat, Jean-Baptiste Lespiau, Mark Rowland 외

We introduce and analyze a class of algorithms, called Mirror Ascent against an Improved Opponent (MAIO), for computing Nash equilibria in two-player zero-sum games, both in normal form and in sequential imperfect inform…

Form

Specification-Guided Learning of Nash Equilibria with High Social Welfare

2022-06-06 · Kishor Jothimurugan, Suguman Bansal, Osbert Bastani, Rajeev Alur

Reinforcement learning has been shown to be an effective strategy for automatically training policies for challenging control problems. Focusing on non-cooperative multi-agent systems, we propose a novel reinforcement le…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Vocal Bursts Intensity Prediction