arXiv (All)
open access
Optimal regret for dynamic matching with static priorities
We study centralized two-way dynamic matching markets in which agents arrive stochastically over time and wait in queues associated with their types. We focus on static priority policies that assign each agent type a fixed ranking over its neighbors and make online matching decisions using only queu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Procedural Fairness in Exchange Matching Systems#98615
- Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives#1202048
- Cross Holding and Imperfect Product Markets#942329
- Not All Matches Are Equally Valuable: An Online Experiment of Retention-Focused Recommendation in a Job-Matching Platform#822089
- Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options#1356687
Record · ID 1457119
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive