Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning

DOI10.1016/J.EJOR.2015.03.015MaRDI QIDQ319629zbMATH OpenOpenAlexFDO

Authors Archis Ghate

Publication date 6 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2015.03.015

zbMATH Keywords

dynamic programmingBayesian learningsequential auctions

Mathematics Subject Classification ID

Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Dynamic lot-sizing in sequential online auction systems with reserve price
• Optimal design of online sequential buy-price auctions with consumer valuation learning
• Dynamic lot-sizing in sequential online retail auctions
• Research note-strategic bid-shading and sequential auctioning with learning from past prices
• On optimal bidding and inventory control in sequential procurement auctions: the multi period case

Cites work

• scientific article; zbMATH DE number 3844820 (Why is no real title available?)
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• scientific article; zbMATH DE number 1220667 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 3205524 (Why is no real title available?)
• A Survey of Some Results in Stochastic Adaptive Control
• A partially observed Markov decision process for dynamic pricing
• Advanced calculus
• An elementary introduction to mathematical finance.
• Auctions with uncertain numbers of bidders
• Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution
• Bayes Solutions of the Statistical Inventory Problem
• Dynamic inventory policy with varying stochastic demands
• Dynamic lot-sizing in sequential online retail auctions
• Dynamic pricing for nonperishable products with demand learning
• Dynamic pricing with a prior on market response
• Myopic Policies for Some Inventory Models with Uncertain Demand Distributions
• Optimal Auction Design
• Optimal Auctioning and Ordering in an Infinite Horizon Inventory-Pricing System
• Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
• Optimal Inventory Policy
• Optimal dynamic auctions for revenue management
• Optimal starting price for eBay-like online auctions
• Stalking information: Bayesian inventory management with unobserved lost sales
• The Inventory Problem: II. Case of Unknown Distributions of Demand
• The monotonicity of the reliability measures of the beta distribution
• Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations

Cited in

(4)

• Optimal design of online sequential buy-price auctions with consumer valuation learning
• Analysis and design for multi-unit online auctions
• Optimal bidding in auctions from a game theory perspective
• Dynamic pricing with Bayesian demand learning and reference price effect

This page was built for publication: Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319629)