Cover Image

Competing Bandits in Decentralized Contextual Matching Markets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Parikh, Satush, Basu, Soumya, Ghosh, Avishek, Sankararaman, Abishek
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Competing Bandits in Matching Markets via Super Stability
by: Basu, Soumya
Published: (2025)

Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets
by: Pagare, Tejas, et al.
Published: (2024)

The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
by: Chawla, Ronshee, et al.
Published: (2020)

Probabilistic Hash Embeddings for Online Learning of Categorical Features
by: Li, Aodong, et al.
Published: (2025)

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

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
by: Slivkins, Aleksandrs, et al.
Published: (2022)

Blocking Bandits
by: Basu, Soumya, et al.
Published: (2019)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020)

Decentralized Contextual Bandits with Network Adaptivity
by: Deng, Chuyun, et al.
Published: (2025)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
by: Sharma, Nihal, et al.
Published: (2021)

Expectation Maximization (EM) Converges for General Agnostic Mixtures
by: Ghosh, Avishek
Published: (2026)

CACTI: Leveraging Copy Masking and Contextual Information to Improve Tabular Data Imputation
by: Gorla, Aditya, et al.
Published: (2025)

Optimal Analysis for Bandit Learning in Matching Markets with Serial Dictatorship
by: Wang, Zilong, et al.
Published: (2025)

Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

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

Linear Contextual Bandits with Interference
by: Xu, Yang, et al.
Published: (2024)

Decentralized Asynchronous Multi-player Bandits
by: Fan, Jingqi, et al.
Published: (2025)

Contextual Bandits for Unbounded Context Distributions
by: Zhao, Puning, et al.
Published: (2024)

Uncertainty of Joint Neural Contextual Bandit
by: Guo, Hongbo, et al.
Published: (2024)

Contextual Bandits with Stage-wise Constraints
by: Pacchiano, Aldo, et al.
Published: (2024)

Designing an Interpretable Interface for Contextual Bandits
by: Maher, Andrew, et al.
Published: (2024)

Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)

Contextual Linear Bandits with Delay as Payoff
by: Zhang, Mengxiao, et al.
Published: (2025)

Group-Sensitive Offline Contextual Bandits
by: Guo, Yihong, et al.
Published: (2025)

Multiplayer Information Asymmetric Contextual Bandits
by: Chang, William, et al.
Published: (2025)

Differentially Private Kernelized Contextual Bandits
by: Pavlovic, Nikola, et al.
Published: (2025)

Constrained Contextual Bandits with Adversarial Contexts
by: Sarkar, Dhruv, et al.
Published: (2026)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

Tree Ensembles for Contextual Bandits
by: Nilsson, Hannes, et al.
Published: (2024)

Calibrated Recommendations with Contextual Bandits
by: Feijer, Diego, et al.
Published: (2025)

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

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

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
by: Kang, Yue, et al.
Published: (2025)

Efficient Contextual Bandits with Uninformed Feedback Graphs
by: Zhang, Mengxiao, et al.
Published: (2024)

Thompson Sampling in Partially Observable Contextual Bandits
by: Park, Hongju, et al.
Published: (2024)

Fairness and Privacy Guarantees in Federated Contextual Bandits
by: Solanki, Sambhav, et al.
Published: (2024)

Partially Observable Contextual Bandits with Linear Payoffs
by: Zeng, Sihan, et al.
Published: (2024)