Cover Image

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Komiyama, Junpei, Mehta, Nishant A., Mortazavi, Ali
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
by: Fujii, Kaito
Published: (2023)

An explainable machine learning-based approach for analyzing customers' online data to identify the importance of product attributes
by: Karimzadeh, Aigin, et al.
Published: (2024)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Group-wise oracle-efficient algorithms for online multi-group learning
by: Deng, Samuel, et al.
Published: (2024)

Incentive-compatible Bandits: Importance Weighting No More
by: Zimmert, Julian, et al.
Published: (2024)

An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)

Responding to Promises: No-regret learning against followers with memory
by: Hebbar, Vijeth, et al.
Published: (2024)

Hierarchies of No-regret Algorithms
by: Xu, R., et al.
Published: (2026)

Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning
by: Sharma, Dravyansh, et al.
Published: (2025)

User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization
by: Cai, Yang, et al.
Published: (2023)

Fairness under Competition
by: Gradwohl, Ronen, et al.
Published: (2025)

Sink equilibria and the attractors of learning in games
by: Biggar, Oliver, et al.
Published: (2025)

A Renegotiable contract-theoretic incentive mechanism for Federated learning
by: Tan, Xavier, et al.
Published: (2025)

Personalized incentives as feedback design in generalized Nash equilibrium problems
by: Fabiani, Filippo, et al.
Published: (2022)

A Market for Accuracy: Classification under Competition
by: Einav, Ohad, et al.
Published: (2025)

Strategic Classification under Unknown Personalized Manipulation
by: Shao, Han, et al.
Published: (2023)

Improved learning rates in multi-unit uniform price auctions
by: Potfer, Marius, et al.
Published: (2025)

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

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

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty
by: Lobo, Elita, et al.
Published: (2024)

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

Leaderboard Incentives: Model Rankings under Strategic Post-Training
by: Chen, Yatong, et al.
Published: (2026)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Incentive-Aware Dynamic Resource Allocation under Long-Term Cost Constraints
by: Dai, Yan, et al.
Published: (2025)

On the Convergence of Federated Learning Algorithms without Data Similarity
by: Beikmohammadi, Ali, et al.
Published: (2024)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
by: Wang, Yige, et al.
Published: (2025)

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

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)

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

Bayesian Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

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)

Optimal Scoring Rule Design under Partial Knowledge
by: Chen, Yiling, et al.
Published: (2021)

High dimensional online calibration in polynomial time
by: Peng, Binghui
Published: (2025)