Overview

Nash equilibrium describes outcomes in strategic settings where each player’s choice is a best response to the others, making it a tool for analyzing competition, coordination, and incentives. Researchers compute equilibria in matrix games, poker, and stochastic or partially observable games using methods such as complementarity solvers, regret minimization, and policy-space response oracles. Learning approaches—including fictitious play, mirror descent, and multi-agent reinforcement learning—seek equilibria from observed payoffs or sampled interactions, with guarantees often depending on game structure and feedback available to players. A central challenge is that convergence, computational tractability, equilibrium selection, and social welfare do not always align: a stable outcome may be inefficient, and different algorithms may reach different equilibria.

Latest papers

CardsList

65 papers4 papers in the last four weeks, up 33% on the four weeks before. 0.0% of all new papers.

  1. Simulation-Based Evaluation of Energy-Constrained Quantum-Classical Competition

    Aug 15, 2023Junyu Liu, Hansheng Jiang, Zuo-Jun Max ShenNash Equilibrium

  2. Generalizing Liquid Democracy to multi-agent delegation: A Voting Weight Measure and Equilibrium Analysis

    Sep 28, 2022Francisco M. BersetcheSocial Choice TheoryNash Equilibrium

  3. Safe Equilibrium

    Jan 12, 2022Sam GanzfriedGame TheoryNash Equilibrium

  4. Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

    Sep 17, 2021Georgios Amanatidis, Georgios Birmpas, Federico Fusco +3Fair Resource AllocationNash Equilibrium