A stronger impossibility for fully online matching (Q2060387): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3198403917 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fully Online Matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal deterministic algorithm for online \(b\)-matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bayesian Mechanism Design / rank | |||
Normal rank | |||
Latest revision as of 12:17, 27 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stronger impossibility for fully online matching |
scientific article |
Statements
A stronger impossibility for fully online matching (English)
0 references
13 December 2021
0 references
online algorithms
0 references
competitive analysis
0 references
matching theory
0 references
