Imagen de Portada

Competing Bandits in Matching Markets via Super Stability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Basu, Soumya
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Competing Bandits in Decentralized Contextual Matching Markets
por: Parikh, Satush, et al.
Publicado: (2024)

Concentrated Differential Privacy for Bandits
por: Azize, Achraf, et al.
Publicado: (2023)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
por: Praharaj, Samya, et al.
Publicado: (2025)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
por: Azize, Achraf, et al.
Publicado: (2025)

Restless Linear Bandits
por: Khaleghi, Azadeh
Publicado: (2024)

Optimal Clustering with Bandit Feedback
por: Yang, Junwen, et al.
Publicado: (2022)

Batched Kernelized Bandits: Refinements and Extensions
por: Ma, Chenkai, et al.
Publicado: (2026)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
por: Wen, Yuxiao, et al.
Publicado: (2025)

Bandit Convex Optimization with Gradient Prediction Adaptivity
por: Wang, Shuche, et al.
Publicado: (2026)

Lower Bounds for Time-Varying Kernelized Bandits
por: Cai, Xu, et al.
Publicado: (2024)

Conversational Dueling Bandits in Generalized Linear Models
por: Yang, Shuhua, et al.
Publicado: (2024)

Quantile Multi-Armed Bandits with 1-bit Feedback
por: Lau, Ivan, et al.
Publicado: (2025)

Online Clustering of Data Sequences with Bandit Information
por: Chandran, G Dhinesh, et al.
Publicado: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
por: Li, Zihan, et al.
Publicado: (2022)

A Modularized Framework for Piecewise-Stationary Restless Bandits
por: Li, Kuan-Ta, et al.
Publicado: (2026)

A General Framework for Clustering and Distribution Matching with Bandit Feedback
por: Yavas, Recep Can, et al.
Publicado: (2024)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
por: Tajdini, Artin, et al.
Publicado: (2025)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
por: Karthik, P. N., et al.
Publicado: (2023)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
por: Panda, Subhodip, et al.
Publicado: (2026)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
por: Bian, Jie, et al.
Publicado: (2024)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
por: Praharaj, Samya, et al.
Publicado: (2025)

Improving Channel Estimation via Multimodal Diffusion Models with Flow Matching
por: Fan, Xiaotian, et al.
Publicado: (2026)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
por: Ryu, J. Jon, et al.
Publicado: (2025)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
por: Yang, Junwen, et al.
Publicado: (2024)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
por: Rajaraman, Nived, et al.
Publicado: (2023)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
por: Mukherjee, Arpan, et al.
Publicado: (2024)

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

Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits
por: Li, Kuan-Ta, et al.
Publicado: (2024)

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
por: Gu, Yuzhou, et al.
Publicado: (2025)

Beam-aware Kernelized Contextual Bandits for User Association and Beamforming in mmWave Vehicular Networks
por: He, Xiaoyang, et al.
Publicado: (2026)

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

Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation
por: Tanzawa, Haruka, et al.
Publicado: (2026)

Adversarial Jamming for Autoencoder Distribution Matching
por: El-Geresy, Waleed, et al.
Publicado: (2025)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
por: Chen, Fan, et al.
Publicado: (2024)

Quantum-Enhanced Neural Contextual Bandit Algorithms
por: Huang, Yuqi, et al.
Publicado: (2026)

Harnessing the Power of Federated Learning in Federated Contextual Bandits
por: Shi, Chengshuai, et al.
Publicado: (2023)

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

Shuffled Linear Regression via Spectral Matching
por: Liu, Hang, et al.
Publicado: (2024)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
por: Hou, Yunlong, et al.
Publicado: (2026)

Blocking Bandits
por: Basu, Soumya, et al.
Publicado: (2019)