Abstract
The present note analyzes the simultaneous ascending-bid auction with arbitrarily many asymmetric bidders with decreasing marginal valuations under complete information. We show that the game is solvable by iterated elimination of weakly dominated strategies if the efficient allocation assigns at least one unit to every player and if bid increments are sufficiently small. In that unique equilibrium, bidders immediately reduce their demand to the efficient allocation, and the auction ends in the first round of bidding.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.