In an auction, bid shading is the practice of a bidder placing a bid that is below what they believe a bid is worth.[1][2]

Bid shading is used for one of two purposes. In a common value auction with incomplete information, bid shading is used to compensate for the winner's curse. In such auctions, the good is worth the same amount to all bidders, but bidders don't know the value of the good and must independently estimate it. Since all bidders value the good equally, the winner will generally be the bidder whose estimate of the value is largest. But if we assume that in general bidders estimate the value accurately, then the highest bidder has overestimated the good's value and will end up paying more than it is worth. In other words, winning the auction carries bad news about a bidder's value estimate. A savvy bidder will anticipate this, and reduce their bid accordingly.

Bid shading is also used in first-price auctions, where the winning bidder pays the amount of his bid. If a participant bids an amount equal to their value for the good, they would gain nothing by winning the auction, since they are indifferent between the money and the good. Bidders will optimize their expected value by accepting a lower chance of winning in return for a higher payoff if they win.

In a first-price common value auction, a savvy bidder should shade for both of the above purposes.

Bid shading is not only a normative theoretical construct, it was detected in the above-mentioned real world auction markets.[3][4] Previous theoretical work on sequential auctions focused either on bid shading in an exogenous sequence of auctions,[5][6] or on strategic auctioning to short-lived buyers, who never want to shade their bids.[7] This paper provides the first model of a sequential auction with both endogenous strategic selling and forward-looking longer-lived buyers who can shade their bids. The model’s contribution is the analysis of the best response of the seller to strategic bid shading, and the exposition of a market equilibrium, in which bidders do not always shade. The most related model of bidding is Jeitschko (1999),[6] who finds that relatively to exogenous and certain future supply, exogenous but uncertain future supply leads to a proportional bid increase. In contrast, high-valuation bidders shade more than low valuation bidders here. The most related model of optimal sequential auctioning by Vulcano, van Ryzin, and Maglaras (2002) (VRM),[7] who study a monopolist selling to unit-demand strategic buyers who each only lives for one period. While VRM’s bidders do not shade their bids by assumption, strategic sequential auctioning has an effect on their bidding strategy because they are forward-looking: there is an incentive to overbid and make the seller sell more units in the current period than would be optimal for her.

See also

References

  1. ↑ Hortaçsu, Ali; Kastl, Jakub; Zhang, Allen (1 January 2018). "Bid Shading and Bidder Surplus in the US Treasury Auction System" (PDF). American Economic Review. 108 (1): 147–169. doi:10.1257/aer.20160675.
  2. ↑ Nautz, D.; Wolfstetter, E. (October 1997). "Bid shading and risk aversion in multi-unit auctions with many bidders". Economics Letters. 56 (2): 195–200. doi:10.1016/S0165-1765(97)81900-3.
  3. ↑ Jofre-Bonet, Mireia; Pesendorfer, Martin (September 2003). "Estimation of a Dynamic Auction Game" (PDF). Econometrica. 71 (5): 1443–1489. doi:10.1111/1468-0262.00455.
  4. ↑ Zeithammer, Robert (August 2006). "Forward-Looking Bidding in Online Auctions". Journal of Marketing Research. 43 (3): 462–476. doi:10.1509/jmkr.43.3.462.
  5. ↑ Milgrom, Paul R.; Weber, Robert J. (1982). "A Theory of Auctions and Competitive Bidding". Econometrica. 50 (5): 1089–1122. doi:10.2307/1911865. hdl:10419/220807. ISSN 0012-9682. JSTOR 1911865.
  6. 1 2 Jeitschko, Thomas D (July 1999). "Equilibrium price paths in sequential auctions with stochastic supply". Economics Letters. 64 (1): 67–72. doi:10.1016/S0165-1765(99)00066-X.
  7. 1 2 Vulcano, Gustavo; van Ryzin, Garrett; Maglaras, Costis (November 2002). "Optimal Dynamic Auctions for Revenue Management". Management Science. 48 (11): 1388–1407. doi:10.1287/mnsc.48.11.1388.269.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.