No article text was recorded for this version.
quick or cheap dilemma
Version 1 of 111 papers21 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Quick or Cheap? Breaking Points in Dynamic Markets
- Blog: Min-Cost Bipartite Perfect Matching with Delays
- Blog: Quick or Cheap? Breaking Points in Dynamic Markets
- Blog: Online Matching with Delays and Stochastic Arrival Times
- Blog: Dynamic Bipartite Matching Market with Arrivals and Departures
- Blog: Online Minimum Cost Matching with Recourse on the Line
- Blog: Deterministic Min-Cost Matching with Delays
- Blog: Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities
- Blog: Deterministic primal-dual algorithms for online k-way matching with delays
- Blog: Online minimum matching with uniform metric and random arrivals
- Blog: Online Matching: Haste makes Waste!
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_quick_or_cheap_dilemma_2a73af6b,
title = {quick or cheap dilemma},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quick-or-cheap-dilemma/rdr_2a73af6bb6fe4706bfd07124b0257a5d},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_quick_or_cheap_dilemma_2a73af6b_v1,
title = {quick or cheap dilemma},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quick-or-cheap-dilemma/rdr_2a73af6bb6fe4706bfd07124b0257a5d/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}