Cover Image

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khosravi, Khashayar, Leme, Renato Paes, Podimata, Chara, Tsorvantzis, Apostolis
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Artificial Intelligence Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)

Incentive-Aware Machine Learning; Robustness, Fairness, Improvement & Causality
by: Podimata, Chara
Published: (2025)

Bandits with Preference Feedback: A Stackelberg Game Perspective
by: Pásztor, Barna, et al.
Published: (2024)

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
by: Podimata, Chara, et al.
Published: (2020)

Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions
by: Ananthakrishnan, Nivasini, et al.
Published: (2024)

Procedural Fairness in Multi-Agent Bandits
by: Caiata, Joshua, et al.
Published: (2026)

Charting the Shapes of Stories with Game Theory
by: Daskalakis, Constantinos, et al.
Published: (2024)

Heterogeneous Multi-Agent Bandits with Parsimonious Hints
by: Mirfakhar, Amirmahdi, et al.
Published: (2025)

Competitive Multi-armed Bandit Games for Resource Sharing
by: Li, Hongbo, et al.
Published: (2025)

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

Incentivizing Desirable Effort Profiles in Strategic Classification: The Role of Causality and Uncertainty
by: Efthymiou, Valia, et al.
Published: (2025)

A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback
by: Aggarwal, Vaneet, et al.
Published: (2025)

Grace Period is All You Need: Individual Fairness without Revenue Loss in Revenue Management
by: Jaillet, Patrick, et al.
Published: (2024)

Desirable Effort Fairness and Optimality Trade-offs in Strategic Learning
by: Efthymiou, Valia, et al.
Published: (2025)

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

Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising
by: Provodin, Danil, et al.
Published: (2023)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
by: Lin, Shishen
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)

Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023)

Rigidity in LLM Bandits with Implications for Human-AI Dyads
by: Wang, Haomiaomiao, et al.
Published: (2026)

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
by: Leme, Renato Paes, et al.
Published: (2023)

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

Dynamic Matching Bandit For Two-Sided Online Markets
by: Li, Yuantong, et al.
Published: (2022)

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

LLM-Powered Preference Elicitation in Combinatorial Assignment
by: Soumalias, Ermis, et al.
Published: (2025)

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

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

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

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

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

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

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

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

Bayesian Conversations
by: Leme, Renato Paes, et al.
Published: (2023)

Procurement Auctions with Best and Final Offers
by: Gkatzelis, Vasilis, et al.
Published: (2025)

AI Testing Should Account for Sophisticated Strategic Behaviour
by: Kovarik, Vojtech, et al.
Published: (2025)

Online Matroid Embeddings
by: Cristi, Andrés, et al.
Published: (2024)

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)