Cover Image

Incentive-compatible Bandits: Importance Weighting No More

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zimmert, Julian, Marinov, Teodor V.
Format:	Preprint
Published:	2024
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

Efficient Opportunistic Approachability
by: Marinov, Teodor Vanislavov, et al.
Published: (2026)

Incentivized Truthful Communication for Federated Bandits
by: Wei, Zhepei, et al.
Published: (2024)

Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)

Improved Bandits in Many-to-one Matching Markets with Incentive Compatibility
by: Kong, Fang, et al.
Published: (2024)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
by: Schiffer, Benjamin, et al.
Published: (2025)

Incentivized Collaboration in Active Learning
by: Cohen, Lee, et al.
Published: (2023)

Prior-Agnostic Incentive-Compatible Exploration
by: Ramalingam, Ramya, et al.
Published: (2026)

Incentivizing Truthful Collaboration in Heterogeneous Federated Learning
by: Chakarov, Dimitar, et al.
Published: (2024)

Incentivizing Time-Aware Fairness in Data Sharing
by: Chen, Jiangwei, et al.
Published: (2025)

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

Incentivizing Exploration with Linear Contexts and Combinatorial Actions
by: Sellke, Mark
Published: (2023)

Learning to Lead: Incentivizing Strategic Agents in the Dark
by: Wu, Yuchen, et al.
Published: (2025)

Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)

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

Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
by: Ehrenberg, Maayan, et al.
Published: (2024)

Incentivizing Honesty among Competitors in Collaborative Learning and Optimization
by: Dorner, Florian E., et al.
Published: (2023)

Incentivizing High-Quality Human Annotations with Golden Questions
by: Liu, Shang, et al.
Published: (2025)

Strategic Incentivization for Locally Differentially Private Federated Learning
by: Pagoti, Yashwant Krishna, et al.
Published: (2025)

p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

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

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
by: Liu, Junyan, et al.
Published: (2025)

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
by: Hosseini, Hadi, et al.
Published: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

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

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

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

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

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2025)

Copyright-Aware Incentive Scheme for Generative Art Models Using Hierarchical Reinforcement Learning
by: Shi, Zhuan, et al.
Published: (2024)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
by: Anagnostides, Ioannis, et al.
Published: (2026)

Achieving PAC Guarantees in Mechanism Design through Multi-Armed Bandits
by: Osogami, Takayuki, et al.
Published: (2024)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Incentive-Theoretic Bayesian Inference for Collaborative Science
by: Bates, Stephen, et al.
Published: (2023)

Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
by: Chen, Ziqin, et al.
Published: (2026)

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)