arXiv (OAI Expanded)
open access
Consistency-Robustness Tradeoffs for Online Bipartite Allocation with Multiple Stages
We study learning-augmented online bipartite allocation with multiple stages. In the $k$-stage vertex-weighted fractional bipartite matching problem, demand vertices arrive in $k$ stages, and the algorithm receives possibly inaccurate predictions of the allocation in each stage. While tight consiste
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 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- The Matroid Secretary Conjecture is True#1084500
- Noise-Robust Distributed Optimization Over Directed Graphs With Row Stochastic Matrices#1077410
- Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead#1145032
- An optimal constant for vector balancing with permutations#1157475
Record · ID 1109877
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