Complex Dynamics in Autobidding Systems
Renato Paes Leme, Georgios Piliouras, Jon Schneider, Kelly Spendlove, Song Zuo
TL;DR
This work develops a dynamical-systems framework for autobidding in auctions, modeling bidder multipliers with dm/dt = U(m) under a return-over-spend constraint and uniform bid-scaling. It reveals rich dynamical behavior, including convergence in two-bidder markets, oscillations in three-bidder setups, and motif-based phenomena such as repressilators leading to bistability, limit cycles, and quasi-periodicity. The authors prove that ROS dynamics can simulate arbitrary linear systems and discrete boolean circuits, linking autobidding to broader dynamical-systems and computational paradigms. These results highlight the potential for complex, non-equilibrium market behavior under autobidding and provide a bridge between economics, synthetic biology motifs, and computation. The findings have implications for understanding market stability, designing auction formats, and exploring computational capabilities embedded in automated bidding ecosystems.
Abstract
It has become the default in markets such as ad auctions for participants to bid in an auction through automated bidding agents (autobidders) which adjust bids over time to satisfy return-over-spend constraints. Despite the prominence of such systems for the internet economy, their resulting dynamical behavior is still not well understood. Although one might hope that such relatively simple systems would typically converge to the equilibria of their underlying auctions, we provide a plethora of results that show the emergence of complex behavior, such as bi-stability, periodic orbits and quasi periodicity. We empirically observe how the market structure (expressed as motifs) qualitatively affects the behavior of the dynamics. We complement it with theoretical results showing that autobidding systems can simulate both linear dynamical systems as well logical boolean gates.
