Modeling Bounded Rationality in Multi Agent Games

This direction is merged into another direction: quantal response modeling. Its last version stays readable and citable here.

Version 1 of 159 papers62 conceptsfrozen 2026-10-04

In classical game theory, we often assume agents are "perfectly rational"—omniscient calculators who always choose the action that maximizes their utility. This assumption leads to the Nash Equilibrium, a state where no player can improve their outcome by changing their strategy.

However, as Max Davy argues, real-world participants—whether humans, robots, or LLMs—are inherently "noisy." They face cognitive limits, environmental uncertainty, and computational constraints. When we model these systems as if they were perfectly rational, our predictions fail. A growing body of research suggests that the key to understanding complex multi-agent interactions is not to ignore this noise, but to treat it as a fundamental part of the equilibrium itself.

From Argmax to Softmax

The core mechanism for modeling this "bounded rationality" is the Quantal Response Equilibrium (QRE). In a standard Nash Equilibrium, an agent looks at the expected payoffs of all actions and performs an argmax to pick the best one. In QRE, the argmax is replaced by a softmax (or logit) function.

As Stefanos Leonardos and Georgios Piliouras demonstrate in Exploration-Exploitation in Multi-Agent Learning, this shift transforms the decision process from a discrete choice into a continuous probability distribution. An agent is most likely to pick the best move, but there is a non-zero probability they will pick a sub-optimal one. The "sharpness" of this distribution is controlled by a rationality parameter (often denoted as $\lambda$).

  • When $\lambda$ is zero, the agent chooses completely at random.
  • As $\lambda$ increases, the agent becomes more sensitive to payoffs, eventually converging to perfect rationality.

This probabilistic framing is more than just a psychological tweak; it makes the entire game-theoretic landscape differentiable. Shenghui Chen and ufuk topcu leverage this in Relationship Design for Socially Desirable Behavior to "program" cooperation into autonomous systems using gradient-based optimization—something that is computationally difficult with rigid Nash models.

Why Noise Improves Learning

Intuitively, noise sounds like a hindrance. Yet, in Multi-Agent Reinforcement Learning (MARL), targeting a QRE instead of a Nash Equilibrium can actually lead to better global outcomes.

In cooperative tasks, agents often get stuck in "suboptimal Nash Equilibria"—traps where the team settles for a mediocre strategy because any individual change would temporarily lower the reward. Jiarong Liu and Haobo Fu show in Maximum Entropy Heterogeneous-Agent Mirror Learning that by distributing action probabilities according to payoffs, agents continue to explore alternative coordination patterns. This "quantal" exploration allows the team to "tunnel" through suboptimal barriers to find the global optimum.

Similarly, Zhihuan Huang and Yuqing Kong found in Decision Aggregation under Quantal Response that collective intelligence benefits from moderate irrationality. Noisy groups can paradoxically outperform perfectly rational ones because the noise preserves "weak information" that a deterministic agent would discard, allowing a majority vote to aggregate a more nuanced signal.

Predicting the Human Element

The most immediate application of this research is in modeling human adversaries and collaborators. Humans do not play games like computers; we make mistakes, but those mistakes are rarely random. We are "quantal" in that we are more likely to make a "near-miss" error than a catastrophic one.

By moving from the "perfect" to the "quantal," researchers are building a game theory that doesn't just work in textbooks, but survives the messy, noisy reality of human and machine interaction.

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_modeling_bounded_rationality_in_multi_ag_82d7b257,
  title = {Modeling Bounded Rationality in Multi Agent Games},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/modeling-bounded-rationality-in-multi-agent-games/rdr_82d7b257427d4903a8c427acc4cd18da},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_modeling_bounded_rationality_in_multi_ag_82d7b257_v1,
  title = {Modeling Bounded Rationality in Multi Agent Games},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/modeling-bounded-rationality-in-multi-agent-games/rdr_82d7b257427d4903a8c427acc4cd18da/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}