Nash Equilibrium
Nash equilibrium, a cornerstone of game theory, describes a stable state in a game where no player can improve their outcome by unilaterally changing their strategy. Current research focuses on developing efficient algorithms, such as those based on reinforcement learning, online learning, and Gaussian processes, to compute Nash equilibria in increasingly complex scenarios, including multi-agent systems, Markov games, and games with incomplete information. These advancements are crucial for addressing challenges in diverse fields like robotics, resource allocation, and cybersecurity, where understanding strategic interactions between agents is paramount for designing effective and robust systems.
200papers
Papers - Page 5
February 29, 2024
February 19, 2024
February 16, 2024
February 13, 2024
February 12, 2024
February 8, 2024
February 7, 2024
February 2, 2024
Open-Loop and Feedback Nash Trajectories for Competitive Racing with iLQGames
Matthias Rowold, Alexander Langmann, Boris Lohmann, Johannes BetzThe Danger Of Arrogance: Welfare Equilibra As A Solution To Stackelberg Self-Play In Non-Coincidental Games
Jake Levi, Chris Lu, Timon Willi, Christian Schroeder de Witt, Jakob Foerster
December 19, 2023