Bounding the menu-size of approximately optimal auctions via optimal-transport duality (Q5230282)
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: Bounding the menu-size of approximately optimal auctions via optimal-transport duality |
scientific article; zbMATH DE number 7096989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the menu-size of approximately optimal auctions via optimal-transport duality |
scientific article; zbMATH DE number 7096989 |
Statements
Bounding the menu-size of approximately optimal auctions via optimal-transport duality (English)
0 references
22 August 2019
0 references
approximate revenue maximization
0 references
auction
0 references
duality
0 references
lower bound
0 references
menu size
0 references
revenue maximization
0 references
upper bound
0 references
0.7792676091194153
0 references
0.7770819664001465
0 references
0.7710292935371399
0 references
