Analysis and design for multi-unit online auctions
From MaRDI portal
Publication:1751766
DOI10.1016/J.EJOR.2016.11.031zbMath1394.91179OpenAlexW2555901684MaRDI QIDQ1751766
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.11.031
Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (3)
Optimal Design of Online Sequential Buy-Price Auctions with Consumer Valuation Learning ⋮ Quality manipulation and limit corruption in competitive procurement ⋮ Competing trade mechanisms and monotone mechanism choice
Cites Work
- Unnamed Item
- Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning
- Dynamic lot-sizing in sequential online retail auctions
- When and why not to auction
- Optimal starting price for eBay-like online auctions
- Auctions with a buy price
- Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations
- The impact of discounting on an auction with a buyout option: a theoretical analysis motivated by eBay's buy-it-now feature
- Buy-price English auction
- Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights
- Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist when Demands are Interdependent
- Optimal Auction Design
- Asymmetric Auctions
- Buy prices in online auctions: Irrationality on the internet?
This page was built for publication: Analysis and design for multi-unit online auctions