Evolutionarily Stable Stackelberg Equilibrium

• URL: http://arxiv.org/abs/2603.18385v2
• Date: Wed, 25 Mar 2026 05:09:43 GMT
• Title: Evolutionarily Stable Stackelberg Equilibrium
• Abstract summary: We present a new solution concept called evolutionarily stable Stackelberg equilibrium (SESS)<n>We study the Stackelberg evolutionary game setting in which there is a single leading player and a symmetric population of followers.<n>Our model applies naturally to biological settings; for example, in cancer treatment the leader represents the physician and the followers correspond to competing cancer cell phenotypes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a new solution concept called evolutionarily stable Stackelberg equilibrium (SESS). We study the Stackelberg evolutionary game setting in which there is a single leading player and a symmetric population of followers. The leader selects an optimal mixed strategy, anticipating that the follower population plays an evolutionarily stable strategy (ESS) in the induced subgame and may satisfy additional ecological conditions. We consider both leader-optimal and follower-optimal selection among ESSs, which arise as special cases of our framework. Prior approaches to Stackelberg evolutionary games either define the follower response via evolutionary dynamics or assume rational best-response behavior, without explicitly enforcing stability against invasion by mutations. We present algorithms for computing SESS in discrete and continuous games, and validate the latter empirically. Our model applies naturally to biological settings; for example, in cancer treatment the leader represents the physician and the followers correspond to competing cancer cell phenotypes.

Related papers

• Self-Evolving Memory for Generative Recommendation [100.15207958893029]
  Generative recommendation has emerged as a promising end-to-end paradigm for personalized recommendation.<n>Existing evolving strategies, such as continual retraining and distillation-based adaptation, directly update the shared model parameters.<n>We propose a self-evolving memory paradigm for generative recommendation, aiming to enable effective evolution across heterogeneous behavioral patterns.
  arXiv  Detail & Related papers  (2026-09-14T14:00:38Z)
• Direct From Darwin: Deriving Advanced Optimizers From Evolutionary First Principles [0.0]
  This paper derives a suite of advanced gradient-based optimization algorithms directly from evolutionary first principles.<n>We prove that, in an asexual context, Fisher's and Wright's historically opposed views of evolution are actually formally equivalent.<n>Even the state-of-the-art Adam can be brought into evolutionary compliance through a minor surgery.
  arXiv  Detail & Related papers  (2026-05-06T17:33:58Z)
• EvoX: Meta-Evolution for Automated Discovery [115.89434419482797]
  EvoX is an adaptive evolution method that optimize its own evolution process.<n>It continuously updates how prior solutions are selected and varied based on progress.<n>It outperforms existing AI-driven evolutionary methods including AlphaEvolve, OpenEvolve, GEPA, and ShinkaEvolve on the majority of tasks.
  arXiv  Detail & Related papers  (2026-02-26T18:54:41Z)
• Evolutionary Systems Thinking -- From Equilibrium Models to Open-Ended Adaptive Dynamics [1.2691047660244335]
  Complex change is often described as "evolutionary" in economics, policy, numerically and technology.<n>This paper argues that evolutionary dynamics should be treated as a core system-thinking problem rather than as a biological metaphor.
  arXiv  Detail & Related papers  (2026-02-17T19:17:50Z)
• Position: Agentic Evolution is the Path to Evolving LLMs [56.733933092220845]
  We argue that addressing this limitation requires a new scaling axis-evolution.<n>Existing deployment-time adaptation methods lack the strategic agency needed to diagnose failures and produce durable improvements.
  arXiv  Detail & Related papers  (2026-01-30T22:15:58Z)
• How Information Evolves: Stability-Driven Assembly and the Emergence of a Natural Genetic Algorithm [1.2691047660244335]
  We present StabilityDriven Assembly (SDA), a framework in which hallmark assembly combined with persistence biases populations toward longer-lived motifs.<n>We apply SDA/GA to chemical symbol space using SMILES fragments with recombination, mutation, and a stability function.<n>Results motivate an evolutionary ladder hypothesis where persistence-driven selection precedes genetic replication.
  arXiv  Detail & Related papers  (2026-01-22T15:47:48Z)
• Agent Alignment in Evolving Social Norms [65.45423591744434]
  We propose an evolutionary framework for agent evolution and alignment, named EvolutionaryAgent. In an environment where social norms continuously evolve, agents better adapted to the current social norms will have a higher probability of survival and proliferation. We show that EvolutionaryAgent can align progressively better with the evolving social norms while maintaining its proficiency in general tasks.
  arXiv  Detail & Related papers  (2024-01-09T15:44:44Z)
• Phylogeny-informed fitness estimation [58.720142291102135]
  We propose phylogeny-informed fitness estimation, which exploits a population's phylogeny to estimate fitness evaluations. Our results indicate that phylogeny-informed fitness estimation can mitigate the drawbacks of down-sampled lexicase. This work serves as an initial step toward improving evolutionary algorithms by exploiting runtime phylogenetic analysis.
  arXiv  Detail & Related papers  (2023-06-06T19:05:01Z)
• When to be critical? Performance and evolvability in different regimes of neural Ising agents [18.536813548129878]
  It has long been hypothesized that operating close to the critical state is beneficial for natural, artificial and their evolutionary systems. We put this hypothesis to test in a system of evolving foraging agents controlled by neural networks. Surprisingly, we find that all populations that discover solutions, evolve to be subcritical.
  arXiv  Detail & Related papers  (2023-03-28T17:57:57Z)
• Evolutionary Strategies with Analogy Partitions in p-guessing Games [0.0]
  We introduce an evolutionary process of learning to investigate the dynamics of learning in unstable p-guessing games environments. We show that our genetic algorithm behaves consistently with previous results in persistent environments, converging to the Nash equilibrium.
  arXiv  Detail & Related papers  (2021-03-26T10:28:23Z)
• Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games [78.65798135008419]
  It remains vastly open how to learn the Stackelberg equilibrium in general-sum games efficiently from samples. This paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in two-player turn-based general-sum games.
  arXiv  Detail & Related papers  (2021-02-23T05:11:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.