Cover Image

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shen, Lingqing, Ho-Nguyen, Nam, Giang-Tran, Khanh-Hung, Kılınç-Karzan, Fatma
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Computer Science and Game Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Online Large-Margin Classification via Dual Certificates
by: Ho-Nguyen, Nam, et al.
Published: (2025)

Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities
by: Shen, Lingqing, et al.
Published: (2026)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

From Majorization to Scaling: Advancing Convex Relaxations of Maximum Entropy Sampling Problem
by: Shen, Lingqing, et al.
Published: (2026)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, et al.
Published: (2024)

Last-Iterate Guarantees for Learning in Co-coercive Games
by: Chandak, Siddharth, et al.
Published: (2026)

Optimal Guarantees for Online Selection Over Time
by: Perez-Salazar, Sebastian, et al.
Published: (2024)

Strategically Robust Aggregative Games
by: Feik, Andreas, et al.
Published: (2026)

Splitting Guarantees for Prophet Inequalities via Nonlinear Systems
by: Brustle, Johannes, et al.
Published: (2024)

Learning How to Strategically Disclose Information
by: Velicheti, Raj Kiriti, et al.
Published: (2024)

Optimistic Online Learning in Symmetric Cone Games
by: Barakat, Anas, et al.
Published: (2025)

Online Multi-Agent Control with Adversarial Disturbances
by: Barakat, Anas, et al.
Published: (2025)

Strategically Robust Game Theory via Optimal Transport
by: Lanzetti, Nicolas, et al.
Published: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Online Fair Allocation with Best-of-Many-Worlds Guarantees
by: Yang, Zongjun, et al.
Published: (2024)

Optimal Online Bookmaking for Binary Games
by: Bhatt, Alankrita, et al.
Published: (2025)

Action Recommendations for Sequentially Rational Strategic Agents
by: Sun, Renyan, et al.
Published: (2026)

Transforming Strategic Games into Biform Games: Applications in Allocation Mechanisms and Green Technology Investment
by: Shuwen, Xiang, et al.
Published: (2025)

Reinforcement Learning for Finite Space Mean-Field Type Games
by: Shao, Kai, et al.
Published: (2024)

Optimal Online Bookmaking for Any Number of Outcomes
by: Tal, Hadar, et al.
Published: (2025)

Two-Stage Stochastic Capacity Expansion in Stable Matching under Truthful or Strategic Preference Uncertainty
by: Bazotte, Maria, et al.
Published: (2025)

Robust Online Selection with Uncertain Offer Acceptance
by: Perez-Salazar, Sebastian, et al.
Published: (2021)

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions
by: Ma, Will, et al.
Published: (2024)

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
by: Yang, Zixian, et al.
Published: (2025)

Differentially Private Online Distributed Aggregative Games With Time-Varying and Non-Identical Communication and Feedback Delays
by: Odeyomi, Olusola, et al.
Published: (2025)

Strategic Negotiations in Endogenous Network Formation
by: Jalan, Akhil, et al.
Published: (2024)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
by: Jalota, Devansh, et al.
Published: (2022)

PREFER: Personalized Review Summarization with Online Preference Learning
by: Roy, Millend, et al.
Published: (2026)

Packing a Knapsack with Items Owned by Strategic Agents
by: Cembrano, Javier, et al.
Published: (2024)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
by: Heymann, Benjamin, et al.
Published: (2024)

The Oracle Complexity of Simplex-based Matrix Games
by: Kornowski, Guy, et al.
Published: (2024)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
by: Qiu, Shuang, et al.
Published: (2022)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
by: Yongacoglu, Bora, et al.
Published: (2021)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
by: Huang, Han, et al.
Published: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
by: Hu, Ruimeng, et al.
Published: (2025)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
by: Simchi-Levi, David, et al.
Published: (2019)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, et al.
Published: (2025)