16 citations · 27 across the 12 of their papers we have counts for
12 papers
Autobidding Equilibria in Sponsored Shopping
Paul Dütting, Yuhao Li, Renato Paes Leme +2
As commerce shifts to digital marketplaces, platforms increasingly monetize traffic through Sponsored Shopping auctions. Unlike classic ``Sponsored Search", where an advertiser typ…
Chaos in Autobidding Auctions
Ioannis Anagnostides, Ian Gemp, Georgios Piliouras +1
As autobidding systems increasingly dominate online advertising auctions, characterizing their long-term dynamical behavior is brought to the fore. In this paper, we examine the dy…
Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
Ioannis Anagnostides, Ian Gemp, Georgios Piliouras +1
We examine the complexity of computing welfare- and revenue-maximizing equilibria in autobidding second-price auctions subject to return-on-spend (RoS) constraints. We show that co…
Auto-bidding and Auctions in Online Advertising: A Survey
Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro +23
In this survey, we summarize recent developments in research fueled by the growing adoption of automated bidding strategies in online advertising. We explore the challenges and opp…
Complex Dynamics in Autobidding Systems
Renato Paes Leme, Georgios Piliouras, Jon Schneider +2
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…
Graded differential groups, Cartan-Eilenberg systems and conjectures in Conley index theory
Kelly Spendlove, Robert Vandervorst
Cartan-Eilenberg systems play an prominent role in the homological algebra of filtered and graded differential groups and (co)chain complexes in particular. We define the concept o…
The algebra of semi-flows: a tale of two topologies
Kelly Spendlove, Robert Vandervorst
To capture the global structure of a dynamical system we reformulate dynamics in terms of appropriately constructed topologies, which we call flow topologies; we call this process…
Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics
Jason Milionis, Christos Papadimitriou, Georgios Piliouras +1
Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or conti…
Morse Theoretic Templates for High Dimensional Homology Computation
Shaun Harker, Konstantin Mischaikow, Kelly Spendlove
We introduce the notion of a template for discrete Morse theory. Templates provide a memory efficient approach to the computation of homological invariants (e.g., homology, persist…
Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality
Stefanos Leonardos, Georgios Piliouras, Kelly Spendlove
The interplay between exploration and exploitation in competitive multi-agent learning is still far from being well understood. Motivated by this, we study smooth Q-learning, a pro…
Homology of configuration spaces of hard squares in a rectangle
Hannah Alpert, Ulrich Bauer, Matthew Kahle +2
We study ordered configuration spaces of hard squares in a rectangle, a generalization of the well-known "15 Puzzle". Our main interest is in the topolo…
A computational framework for connection matrix theory
Shaun Harker, Konstantin Mischaikow, Kelly Spendlove
The connection matrix is a powerful algebraic topological tool from Conley index theory that captures relationships between isolated invariant sets. Conley index theory is a topolo…