Multi-agent reinforcement learning for decentralized stable matching

DOI10.1007/978-3-030-87756-9_24OpenAlexW3209001103MaRDI QIDQ2695458

Judy Goldsmith, Brent Harrison, Kshitija Taywade

Publication date: 31 March 2023

Full work available at URL: https://arxiv.org/abs/2005.01117

zbMATH Keywords

stable matchingdecentralized systemmulti-agent reinforcement learning

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Uses Software

• Adam

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decentralized job matching
• Stable marriage and indifference
• Instability of matchings in decentralized markets with various preference structures
• On the survival of some unstable two-sided matching mechanisms
• Decentralized matching: the role of commitment
• Efficient Approximation Algorithms for Weighted $b$-Matching
• Dynamic Matching, Two-Sided Incomplete Information, and Participation Costs: Existence and Convergence to Perfect Competition
• Three Fast Algorithms for Four Problems in Stable Marriage
• Distributed Weighted Matching
• College Admissions and the Stability of Marriage

This page was built for publication: Multi-agent reinforcement learning for decentralized stable matching