Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (Q319629)
From MaRDI portal
!
WARNING
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 6633610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning |
scientific article; zbMATH DE number 6633610 |
Statements
Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (English)
0 references
6 October 2016
0 references
sequential auctions
0 references
Bayesian learning
0 references
dynamic programming
0 references
0.8004174828529358
0 references
0.7726802229881287
0 references
0.7609496116638184
0 references
0.7574376463890076
0 references
