Optimizing discrete dutch auctions with time considerations: a strategic approach for lognormal valuation distributions
Keywords:
Auctions, Lognormal distribution, Nonlinear programming, Discrete Dutch auction, Revenue optimizationAbstract
This research deviates from usual studies in auction literature primarily focused on maximizing expected revenue. Instead, we concentrate on the strategic design of discrete Dutch auctions in the context of bidder emotional attachment, wherein valuations follow a lognormal distribution. Our objective is to attain an optimal balance between the auctioned object’s selling price and the auction duration, ultimately maximizing the auctioneer’s expected revenue per unit of time. Our proposed models exhibit significantly higher average revenues per unit of time than counterparts neglecting time considerations and emotional attachment of the bidders. This achievement results from strategically reducing auction durations, enabling more auctions within the allotted time. This intentional trade-off ensures the marginal revenue decrease in shorter auctions is surpassed by the substantial increase in overall revenues from heightened auction frequency. Numerical results emphasize the utility of our modified discrete Dutch auction design, particularly in scenarios with a large number of bidders. Furthermore, increasing skewness in valuation distributions correlates with higher revenue per unit of time. Complete knowledge of the number of participating bidders is crucial, leading to a noticeable elevation in the auctioneer’s expected revenue per unit of time. However, the predictability of auction outcomes may be challenging, underscoring the nuanced nature of auction dynamics.
Published
How to Cite
Issue
Section
Copyright (c) 2024 Raja Aqib Shamim, Majid Khan Majahar Ali
This work is licensed under a Creative Commons Attribution 4.0 International License.