Pages that link to "Item:Q421653"
From MaRDI portal
The following pages link to Dynamic lot-sizing in sequential online retail auctions (Q421653):
Displaying 9 items.
- Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning (Q319629) (← links)
- Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
- Optimal bidding in auctions from a game theory perspective (Q320681) (← links)
- On optimal bidding and inventory control in sequential procurement auctions: the multi period case (Q490174) (← links)
- Analysis and design for multi-unit online auctions (Q1751766) (← links)
- On bidding for a fixed number of items in a sequence of auctions (Q1926913) (← links)
- Dynamic procurement management by reverse auctions with fixed setup costs and sales levers (Q2289310) (← links)
- Approaches to multistage one-shot decision making (Q2356274) (← links)
- Optimal Design of Online Sequential Buy-Price Auctions with Consumer Valuation Learning (Q5149552) (← links)
