:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wu, Binglin, Zhang, Yingyi, Li, Xianneng, Deng, Ruyue, Yue, Chuan, Zhang, Weiru, Zeng, Xiaoyi
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2602.08261
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Large-Scale Auto-bidding with Nash Equilibrium Constraints
by: Mou, Zhiyu, et al.
Published: (2025)

Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints
by: Liaw, Christopher, et al.
Published: (2023)

Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification
by: Han, Jiale, et al.
Published: (2025)

Optimal Boost Design for Auto-bidding Mechanism with Publisher Quality Constraints
by: Yan, Huanyu, et al.
Published: (2025)

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

Trajectory-wise Iterative Reinforcement Learning Framework for Auto-bidding
by: Li, Haoming, et al.
Published: (2024)

Incentive Compatibility in the Auto-bidding World
by: Alimohammadi, Yeganeh, et al.
Published: (2023)

Risk-Averse and Optimistic Advertiser Incentive Compatibility in Auto-bidding
by: Liaw, Christopher, et al.
Published: (2025)

Proportional Dynamics in Linear Fisher Markets with Auto-bidding: Convergence, Incentives and Fairness
by: Li, Juncheng, et al.
Published: (2024)

Sealed-bid Auctions on Blockchain with Timed Commitment Outsourcing
by: Li, Jichen, et al.
Published: (2024)

Vulnerabilities of Single-Round Incentive Compatibility in Auto-bidding: Theory and Evidence from ROI-Constrained Online Advertising Markets
by: Li, Juncheng, et al.
Published: (2022)

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

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
by: Lucier, Brendan, et al.
Published: (2023)

C2:Cross learning module enhanced decision transformer with Constraint-aware loss for auto-bidding
by: Ding, Jinren, et al.
Published: (2026)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization
by: Zhang, Brian Hu, et al.
Published: (2022)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
by: Aggarwal, Gagan, et al.
Published: (2024)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
by: Duan, Zhijian, et al.
Published: (2025)

Achieving Pareto Optimality in Games via Single-bit Feedback
by: Kiremitci, Seref Taha, et al.
Published: (2025)

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

Steering No-Regret Learners to a Desired Equilibrium
by: Zhang, Brian Hu, et al.
Published: (2023)

A Lower Bound on Swap Regret in Extensive-Form Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Satisfaction and Regret in Stackelberg Games
by: White, Langford, et al.
Published: (2024)

Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
by: Brihaye, Thomas, et al.
Published: (2023)

Finding Pareto frontier for one-sided matching
by: Dodda, Bhavik, et al.
Published: (2026)

Pareto Optimality in Approval-Based Multiwinner Voting
by: Schünke, Joshua
Published: (2026)

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

Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium
by: Ren, Hang, et al.
Published: (2025)

Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments
by: Qiu, Chen, et al.
Published: (2021)

Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning
by: Zhang, Yuheng, et al.
Published: (2024)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Guiding the Recommender: Information-Aware Auto-Bidding for Content Promotion
by: Liu, Yumou, et al.
Published: (2026)

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
by: Zhang, Mengxiao, et al.
Published: (2024)

Promises Made, Promises Kept: Safe Pareto Improvements via Ex Post Verifiable Commitments
by: Sauerberg, Nathaniel, et al.
Published: (2025)

Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Learning not to Regret
by: Sychrovský, David, et al.
Published: (2023)

On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
by: Jin, Jiarong, et al.
Published: (2025)