No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559)
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 6952554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No truthful mechanism can be better than \(n\) approximate for two natural problems |
scientific article; zbMATH DE number 6952554 |
Statements
No truthful mechanism can be better than \(n\) approximate for two natural problems (English)
0 references
12 October 2018
0 references
mechanism design
0 references
truthful mechanisms
0 references
inapproximability
0 references
non-Utilitarian problems
0 references
lower bounds
0 references
0 references
0.86424696
0 references
0.85700125
0 references
0.84490216
0 references
0.8222795
0 references
0.8204051
0 references
0 references
0.81992555
0 references
0.8193464
0 references
0.81877106
0 references
0.8186023
0 references
