Cover Image

Optimal Algorithms for Bandit Learning in Matching Markets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pagare, Tejas, Bandyopadhyay, Agniv, Juneja, Sandeep
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Systems and Control Theoretical Economics Dynamical Systems
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asynchronous Proportional Response Dynamics in Markets with Adversarial Scheduling
by: Kolumbus, Yoav, et al.
Published: (2023)

The emergence of chaos in population game dynamics induced by comparisons
by: Bielawski, Jakub, et al.
Published: (2024)

Time-Varyingness in Auction Breaks Revenue Equivalence
by: Fujimoto, Yuma, et al.
Published: (2024)

Resource Sharing in Energy Communities: A Cooperative Game Approach
by: Alahmed, Ahmed S., et al.
Published: (2023)

Dynamic Net Metering for Energy Communities
by: Alahmed, Ahmed S., et al.
Published: (2023)

Linearly Solvable Continuous-Time General-Sum Stochastic Differential Games
by: Tomar, Monika, et al.
Published: (2026)

Dynamic Population Games: A Tractable Intersection of Mean-Field Games and Population Games
by: Elokda, Ezzat, et al.
Published: (2021)

On Mechanism Underlying Algorithmic Collusion
by: Xu, Zhang, et al.
Published: (2024)

Allocation of Heterogeneous Resources in General Lotto Games
by: Paarporn, Keith, et al.
Published: (2025)

Choice Paralysis in Evolutionary Games
by: Anderson, Brendon G.
Published: (2025)

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)

Exclusion Zones of Instant Runoff Voting
by: Tomlinson, Kiran, et al.
Published: (2025)

Capital Games and Growth Equilibria
by: Abramowitz, Ben
Published: (2025)

Cycles and collusion in congestion games under Q-learning
by: Carissimo, Cesare, et al.
Published: (2025)

The Moderating Effect of Instant Runoff Voting
by: Tomlinson, Kiran, et al.
Published: (2023)

Robust Auction Design with Support Information
by: Anunrojwong, Jerry, et al.
Published: (2023)

Analyzing Incentives and Fairness in Ordered Weighted Average for Facility Location Games
by: Yoshida, Kento, et al.
Published: (2024)

Cooperation, Retaliation and Forgiveness in Revision Games
by: Hao, Dong, et al.
Published: (2021)

$α$-Rank-Collections: Analyzing Expected Strategic Behavior with Uncertain Utilities
by: Pieroth, Fabian R., et al.
Published: (2022)

Sustaining Cooperation in Populations Guided by AI: A Folk Theorem for LLMs
by: Shaki, Jonathan, et al.
Published: (2026)

Revenue Non-monotonicity in Matching Markets
by: Hartline, Jason
Published: (2026)

Consistent Conjectures in Dynamic Matching Markets
by: Doval, Laura, et al.
Published: (2024)

Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners
by: Easley, David, et al.
Published: (2025)

Computing and Learning Stationary Mean Field Equilibria with Scalar Interactions: Algorithms and Applications
by: Light, Bar
Published: (2025)

Strategic Algorithmic Monoculture: Experimental Evidence from Coordination Games
by: Ballestero, Gonzalo, et al.
Published: (2026)

Distributed Interview Selection for Stable Matching in Large Random Markets
by: Cole, Richard, et al.
Published: (2025)

Near-feasible Fair Allocations in Two-sided Markets
by: Cembrano, Javier, et al.
Published: (2025)

Simple vs. Optimal Congestion Pricing
by: Jalota, Devansh, et al.
Published: (2026)

Optimal Guarantees for Online Selection Over Time
by: Perez-Salazar, Sebastian, et al.
Published: (2024)

Algorithmic Information Disclosure in Optimal Auctions
by: Cai, Yang, et al.
Published: (2024)

Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers
by: Blanchard, Moise, et al.
Published: (2024)

Wisdom and Foolishness of Noisy Matching Markets
by: Peng, Kenny, et al.
Published: (2024)

Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models
by: Panageas, Ioannis, et al.
Published: (2021)

Fair Coordination in Strategic Scheduling
by: Lee, Wei-Chen, et al.
Published: (2025)

Federated Learning and Free-riding in a Competitive Market
by: Meng, Jiajun, et al.
Published: (2024)

Game of arrivals at a two queue network with heterogeneous customer routes
by: Bandyopadhyay, Agniv, et al.
Published: (2023)

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

Nash Convergence of Mean-Based Learning Algorithms in First-Price Auctions
by: Deng, Xiaotie, et al.
Published: (2021)

Fairness in Repeated Matching: A Maximin Perspective
by: Lim, Eugene, et al.
Published: (2025)

Fragile Stable Matchings
by: Rudov, Kirill
Published: (2024)