Imagen de Portada

Chaos in Autobidding Auctions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Anagnostides, Ioannis, Gemp, Ian, Piliouras, Georgios, Spendlove, Kelly
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Complex Dynamics in Autobidding Systems
por: Leme, Renato Paes, et al.
Publicado: (2024)

Autobidding Equilibria in Sponsored Shopping
por: Dütting, Paul, et al.
Publicado: (2026)

Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization
por: Gemp, Ian, et al.
Publicado: (2023)

NfgTransformer: Equivariant Representation Learning for Normal-form Games
por: Liu, Siqi, et al.
Publicado: (2024)

No-Regret Online Autobidding Algorithms in First-price Auctions
por: Deng, Yuan, et al.
Publicado: (2025)

Visualizing 2x2 Normal-Form Games: twoxtwogame LaTeX Package
por: Marris, Luke, et al.
Publicado: (2024)

Revenue Guarantees in Autobidding Platforms
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning
por: Gemp, Ian, et al.
Publicado: (2024)

Deviation Ratings: A General, Clone-Invariant Rating Method
por: Marris, Luke, et al.
Publicado: (2025)

Charting the Shapes of Stories with Game Theory
por: Daskalakis, Constantinos, et al.
Publicado: (2024)

Re-evaluating Open-ended Evaluation of Large Language Models
por: Liu, Siqi, et al.
Publicado: (2025)

Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

On the Interplay between Social Welfare and Tractability of Equilibria
por: Anagnostides, Ioannis, et al.
Publicado: (2023)

Solving Zero-Sum Convex Markov Games
por: Kalogiannis, Fivos, et al.
Publicado: (2025)

Nash Equilibria via Stochastic Eigendecomposition
por: Gemp, Ian
Publicado: (2024)

Platform Competition in the Autobidding World
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
por: Leonardos, Stefanos, et al.
Publicado: (2021)

Model Monotonicity in Autobidding Auctions: When Do Better Predictions Lead to Better Outcomes?
por: Badanidiyuru, Ashwinkumar
Publicado: (2026)

Auto-bidding and Auctions in Online Advertising: A Survey
por: Aggarwal, Gagan, et al.
Publicado: (2024)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Multi-Platform Autobidding with and without Predictions
por: Aggarwal, Gagan, et al.
Publicado: (2025)

Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets Heisenberg
por: Feng, Yi, et al.
Publicado: (2024)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

Position Auctions with a Capacity Constraint
por: Batziou, Eleni, et al.
Publicado: (2026)

Steering Language Models with Game-Theoretic Solvers
por: Gemp, Ian, et al.
Publicado: (2024)

On the Complexity of Learning Nash Equilibria
por: Biggar, Oliver, et al.
Publicado: (2026)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

Barriers to Welfare Maximization with No-Regret Learning
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
por: Colini-Baldeschi, Riccardo, et al.
Publicado: (2025)

Deep Incentive Design with Differentiable Equilibrium Blocks
por: Thoma, Vinzenz, et al.
Publicado: (2026)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2025)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
por: Zhang, Brian Hu, et al.
Publicado: (2026)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
por: Lazarsfeld, John, et al.
Publicado: (2025)

No-Regret Learning and Equilibrium Computation in Quantum Games
por: Lin, Wayne, et al.
Publicado: (2023)

Learning in Quantum Common-Interest Games and the Separability Problem
por: Lin, Wayne, et al.
Publicado: (2023)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
por: Lazarsfeld, John, et al.
Publicado: (2025)

Selling an Item Among a Strategic Bidder and a Profiled Agent
por: Caragiannis, Ioannis, et al.
Publicado: (2025)