arXiv (All)
open access
Stability in stochastic hypergraph matching I: necessary and sufficient criteria
Stochastic matching on hypergraphs is an important topic for its versatility in capturing real-life systems, from living donor transplant to ride-hailing. Nevertheless, finding necessary and sufficient criteria for stability is a long-standing problem. One of the key difficulties is the fact that gr
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
- Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time#620394
- Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time#618715
- Online Stochastic Matchings: Stability on Hypergraphs#386787
- Dynamic Directed Random Matching#21611
- Smooth Partial Lotteries for Stable Randomized Selection#204785
Record · ID 1143854
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