Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (Q319629): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91B26 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6633610 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sequential auctions | |||
| Property / zbMATH Keywords: sequential auctions / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Bayesian learning | |||
| Property / zbMATH Keywords: Bayesian learning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic programming | |||
| Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Revision as of 01:41, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning |
scientific article |
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
