arXiv (All)
open access
Arrival-Time Incentive Compatibility in Random Order Online Bipartite Matching
In this work we initiate the study of competitive algorithms with arrival-time incentive compatibility for random-order online bipartite matching in settings where the users care only about receiving service (matched vs. unmatched) and not which offline resource serves them, while the platform's obj
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
- The Exact Law of Large Numbers for Independent Random Matching#21082
- Simultaneous Envy and Equitability Guarantees#1084340
- Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling#612584
- Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling#611107
- Sequential Pricing Mechanisms for Surplus Division#924902
Record · ID 1131153
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