The price of optimum: complexity and approximation for a matching game (Q521813)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6705194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The price of optimum: complexity and approximation for a matching game |
scientific article; zbMATH DE number 6705194 |
Statements
The price of optimum: complexity and approximation for a matching game (English)
0 references
12 April 2017
0 references
approximation algorithm
0 references
strategic game
0 references
complexity
0 references
price of anarchy
0 references
price of optimum
0 references
Stackelberg strategy
0 references
0.8653725385665894
0 references
0.7995019555091858
0 references
0.7870011329650879
0 references
0.7796939015388489
0 references
0.7788671851158142
0 references
