Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max-min greedy matching problem: hardness for the adversary and fractional variant |
scientific article; zbMATH DE number 7789584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max-min greedy matching problem: hardness for the adversary and fractional variant |
scientific article; zbMATH DE number 7789584 |
Statements
Max-min greedy matching problem: hardness for the adversary and fractional variant (English)
0 references
16 January 2024
0 references
online matching
0 references
pricing mechanism
0 references
markets
0 references
max-min greedy matching
0 references
adversarial hardness
0 references
fractional matching
0 references
0 references
0 references
0.9512569308280944
0 references
0.775408148765564
0 references
0.7124028205871582
0 references
0.7117342948913574
0 references
