Complex Dynamics in Autobidding Systems
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Jun 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Large-Scale Auto-bidding with Nash Equilibrium Constraintscited by 0
- 2025Learning to Coordinate Bidders in Non-Truthful Auctionscited by 0
- 2026Inference Auctionscited by 0
- 2026Inference Auctions30 Sep 2026
- 2025Learning to Coordinate Bidders in Non-Truthful Auctions3 Jul 2025
- 2025Large-Scale Auto-bidding with Nash Equilibrium Constraints13 Mar 2025