From simultaneous to leader–follower play in direct reciprocity

Repeated interaction is a key mechanism driving the evolution of cooperation, generosity, extortion, and other social behaviors. These behaviors are typically studied using two-player repeated games, where the two players act simultaneously in every round. In this article, we begin with a standard two-action repeated game, but transform it into a leader-follower game. We do this by forcing one player to indicate their impending move, or to openly commit first in each round. We show that this simple transformation provides new and useful analytical insights. In particular, we use this transformation to derive expressions for the main classes of simultaneous-move Nash equilibria of memory-1, when payoffs are discounted. We show that these equilibria also remain stable under the leader-follower structure. We prove that this reassuring property does not always extend to games with more than two actions or to equilibrium strategies with longer memory. Overall, we establish a novel connection between repeated simultaneous-move games and repeated leader-follower games in evolutionary game theory. This approach offers fruitful means of investigating how prediction and anticipation play a role in stable social behavior.

Authors

Institutions

Publication Details

Journal
PNAS Nexus
Published
2026-01-13
DOI
https://doi.org/10.1093/pnasnexus/pgag005
Primary Topic
Evolutionary Game Theory and Cooperation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

From simultaneous to leader–follower play in direct reciprocity

Philip LaPorte, Lenz Pracher, Saptarshi Pal
PNAS Nexus
Evolutionary Game Theory and Cooperation
article

From simultaneous to leader–follower play in direct reciprocity

Philip LaPorte, Lenz Pracher, Saptarshi Pal
article en

Abstract

Repeated interaction is a key mechanism driving the evolution of cooperation, generosity, extortion, and other social behaviors. These behaviors are typically studied using two-player repeated games, where the two players act simultaneously in every round. In this article, we begin with a standard two-action repeated game, but transform it into a leader-follower game. We do this by forcing one player to indicate their impending move, or to openly commit first in each round. We show that this simple transformation provides new and useful analytical insights. In particular, we use this transformation to derive expressions for the main classes of simultaneous-move Nash equilibria of memory-1, when payoffs are discounted. We show that these equilibria also remain stable under the leader-follower structure. We prove that this reassuring property does not always extend to games with more than two actions or to equilibrium strategies with longer memory. Overall, we establish a novel connection between repeated simultaneous-move games and repeated leader-follower games in evolutionary game theory. This approach offers fruitful means of investigating how prediction and anticipation play a role in stable social behavior.

PNAS NexusVol. 5(2)
Harvard University (US), Harvard University Press (US), Center for Theoretical Physics (PL), Technical University of Munich (DE), Ludwig-Maximilians-Universität München (DE), University of California, Berkeley (US)
National Science Foundation
Openalex Percentile: Top 91%
Evolutionary Game Theory and Cooperation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

From simultaneous to leader–follower play in direct reciprocity — Philip LaPorte, Lenz Pracher, et al. · PNAS Nexus (2026) | TGRS Research Map | TGRS