Robust auction design under multiple priors by linear and integer programming (Q1703555)
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: Robust auction design under multiple priors by linear and integer programming |
scientific article; zbMATH DE number 6846272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust auction design under multiple priors by linear and integer programming |
scientific article; zbMATH DE number 6846272 |
Statements
Robust auction design under multiple priors by linear and integer programming (English)
0 references
2 March 2018
0 references
optimal auction design
0 references
robustness
0 references
multiple priors
0 references
ambiguity
0 references
linear programming
0 references
mixed-integer programming
0 references
0.839759886264801
0 references
0.776735782623291
0 references
0.7663332223892212
0 references
0.763420820236206
0 references
0.7579767107963562
0 references
