Hu, E., Rao, C., Zhao, Y. (2019). A class Hotelling model for sequential auctions of close substitutes. Scientia Iranica, 26(3), 1778-1788. doi: 10.24200/sci.2018.20546
Erqin Hu; Congjun Rao; Yong Zhao. "A class Hotelling model for sequential auctions of close substitutes". Scientia Iranica, 26, 3, 2019, 1778-1788. doi: 10.24200/sci.2018.20546
Hu, E., Rao, C., Zhao, Y. (2019). 'A class Hotelling model for sequential auctions of close substitutes', Scientia Iranica, 26(3), pp. 1778-1788. doi: 10.24200/sci.2018.20546
Hu, E., Rao, C., Zhao, Y. A class Hotelling model for sequential auctions of close substitutes. Scientia Iranica, 2019; 26(3): 1778-1788. doi: 10.24200/sci.2018.20546
A class Hotelling model for sequential auctions of close substitutes
1Systems Engineering Institute of Automation School, Huazhong University of Science and Technology, Wuhan 430074, P. R. China
2School of Science, Wuhan University of Technology, Wuhan 430070, P. R. China
3School of Science, Hubei University of Technology, Wuhan 430068, P. R. China
Abstract
Against the background of supply chains, this paper constructs a class Hotelling model to describe and explore sequential auctions of close substitutes with slightly more general associated valuations. In this generalized model, both close substitutes and bidders are hypothetically distributed in the interval [0, 1], types of bidders are continuous, and each bidder’s valuations for close substitutes are not independent. And with the aid of this model, equilibriums are explored and efficiencies of the auctions are analyzed under second-price sealed-bid auction formats. Further considering two typical information policies, we investigate some concrete bids and revenues of the efficient sequential auctions while bidders’ valuations are linear functions of distances between them and close substitutes. Results show that efficiencies of the sequential auctions are conditional, and influences of information policies on revenues of the auctions are related to both numbers of bidders and locations of items.
Top