:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lee, Junghyun, Hong, Minju, Jun, Kwang-Sung, Yun, Chulhee, Yun, Se-Young
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2602.23116
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
by: Xin, Yun, et al.
Published: (2025)

Online Recommendations for Agents with Discounted Adaptive Preferences
by: Agarwal, Arpit, et al.
Published: (2023)

Entry Barriers in Content Markets
by: Zhu, Haiqing, et al.
Published: (2025)

Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?
by: Gölz, Paul, et al.
Published: (2025)

Pessimism-Free Offline Learning in General-Sum Games via KL Regularization
by: Chen, Claire, et al.
Published: (2026)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
by: Lee, Junghyun, et al.
Published: (2024)

Accelerated Preference Elicitation with LLM-Based Proxies
by: Huang, David, et al.
Published: (2025)

Proportional Aggregation of Preferences for Sequential Decision Making
by: Chandak, Nikhil, et al.
Published: (2023)

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms
by: Khosravi, Khashayar, et al.
Published: (2023)

Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)

The Power of Regularization in Solving Extensive-Form Games
by: Liu, Mingyang, et al.
Published: (2022)

Regularized Proportional Fairness Mechanism for Resource Allocation Without Money
by: Zeng, Sihan, et al.
Published: (2025)

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

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Offline Two-Player Zero-Sum Markov Games with KL Regularization
by: Chen, Claire, et al.
Published: (2026)

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching
by: Shi, Zhekun, et al.
Published: (2025)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

Fundamental Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2023)

Online Omniprediction with Long-Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

Analyzing Skill Element in Online Fantasy Cricket
by: Sarkar, Sarthak, et al.
Published: (2025)

Online Stackelberg Optimization via Nonlinear Control
by: Brown, William, et al.
Published: (2024)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Online Budgeted Matching with General Bids
by: Yang, Jianyi, et al.
Published: (2024)

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Blind Inverse Game Theory: Jointly Decoding Rewards and Rationality in Entropy-Regularized Competitive Games
by: Virk, Hamza, et al.
Published: (2025)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
by: Yu, Eason, et al.
Published: (2025)

Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
by: Shao, Han, et al.
Published: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

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

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

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

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2024)