Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (Q319629): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069909730 / rank | |||
Normal rank | |||
Revision as of 23:58, 19 March 2024
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
