Bandit Social Learning: Exploration under Myopic Behavior

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Banihashem, Kiarash, Hajiaghayi, MohammadTaghi, Shin, Suho, Slivkins, Aleksandrs
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal Contest Beyond Convexity
by: Golrezaei, Negin, et al.
Published: (2026)

Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)

Bi-Criteria Metric Distortion
by: Banihashem, Kiarash, et al.
Published: (2024)

Algorithmic Delegated Choice: An Annotated Reading List
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

Bandit Social Learning with Exploration Episodes
by: Banihashem, Kiarash, et al.
Published: (2026)

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

Incentivizing Exploration with Selective Data Disclosure
by: Immorlica, Nicole, et al.
Published: (2018)

Matroid Algorithms Under Size-Sensitive Independence Oracles
by: Banihashem, Kiarash, et al.
Published: (2026)

Delegation with Costly Inspection
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)

Replicable Composition
by: Banihashem, Kiarash, et al.
Published: (2026)

Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)

Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
by: Banihashem, Kiarash, et al.
Published: (2025)

Single-Sample Bilateral Trade with a Broker
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2026)

Regret Analysis of Repeated Delegated Choice
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2023)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
by: Banihashem, Kiarash, et al.
Published: (2025)

Introduction to Multi-Armed Bandits
by: Slivkins, Aleksandrs
Published: (2019)

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

Pandora with Inaccurate Priors
by: Banihashem, Kiarash, et al.
Published: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)

Gains-from-Trade in Bilateral Trade with a Broker
by: Hajiaghayi, Ilya, et al.
Published: (2024)

How Bad Is Forming Your Own Multidimensional Opinion?
by: Banihashem, Kiarash, et al.
Published: (2025)

Ad Auctions for LLMs via Retrieval Augmented Generation
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)

Bandit Sequential Posted Pricing via Half-Concavity
by: Singla, Sahil, et al.
Published: (2023)

Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
by: Slivkins, Aleksandrs, et al.
Published: (2025)

Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)

Designing Exploration Contracts
by: Hoefer, Martin, et al.
Published: (2024)

Exploration and Persuasion
by: Slivkins, Aleksandrs
Published: (2024)

Randomized Binary and Tree Search under Pressure
by: Caracci, Agustín, et al.
Published: (2024)

2-Approximation for Prize-Collecting Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2023)

Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2025)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
by: Ahmadi, Ali, et al.
Published: (2025)

Prize-Collecting Steiner Tree: A 1.79 Approximation
by: Ahmadi, Ali, et al.
Published: (2024)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

Contextual Learning for Stochastic Optimization
by: Heuser, Anna, et al.
Published: (2025)

MATWA: A Web Toolkit for Matching under Preferences
by: Glitzner, Frederik, et al.
Published: (2024)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)