arXiv (All)
open access
Dynamic Matching with Abandonment: Optimal Guarantees via Static Priority Policies
computational-complexitycomputer-science-and-game-theorydata-structures-and-algorithmsoptimization-and-controltheoretical-economics
We study stochastic dynamic matching with abandonment, a fundamental model in which agents of different types arrive over time, may abandon the market while waiting, and can be matched in pairs for rewards that depend on their types. No online policy can guarantee more than $0.5$ of the omniscient b
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
- Second-Best Gains from Trade in Matching Markets#1012891
- Computing Stable Matchings under Complementarities and Preference Misalignment#1202756
- Cross Holding and Imperfect Product Markets#942329
- Degree-Parameterized Analysis of Sampling-Based Online Matching#1083917
- Unbalanced Minimal Matchings for Measurable Scale Invariant Costs on $\mathbb{R}^d$#1014020
Record · ID 1297343
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