First-price Common-value Auction Research Articles

An experiment on first-price common-value auctions with asymmetric information structures: The blessed winner

In common-value auctions bidders have access to public information, and may also hold private information prior to choosing their bids. The literature has predominately focused on the case in which bidders are ex-ante symmetric and privately informed, and finds that aggressive bidding such that payoffs are negative is common (the winner's curse). In practice, bidders often only have access to public information, and use this information to form (possibly differing) beliefs. In addition, a bidder who is not privately informed may face bidders who are. We examine bidding behavior of both informed and uninformed bidders, and vary the information structure they face. We find that uninformed bidders underbid dramatically and persistently, while informed bidders tend to overbid in the two-bidder case. Our results highlight the importance of correctly modeling the information available to bidders.

Implications of a Reserve Price in an Agent-Based Common-Value Auction

Auction sellers can use a reserve price to require a minimum bid before items are sold. Theoretical and experimental research has tested the influence of a reserve price in an independent private values auction, but little focus has been given to the influence of a reserve price in a first-price common-value auction. We establish an agent-based first-price common-value auction to determine the impact of the reserve price with two buyers and with three buyers. An agent-based approach to this problem is both a unique contribution to the literature and appropriate since finding analytical solutions with common-value auctions is difficult. The agent-based model approach also allows us to consider buyers that have non-symmetric bid functions. Furthermore, we introduce a combination of numerical integration techniques with a new particle swarm learning algorithm. The buyers in the model choose their expected-net-revenue-maximizing bid price, and sellers choose their expected-revenue-maximizing reserve price. In the two-buyer and three-buyer auction, a reserve price increases the equilibrium winning bid price, decreases the probability that the item is sold, and increases the seller's expected revenue. A reserve price in a two-buyer auction increases the winning bid price more than including an additional buyer in the auction with no reserve price. However, due to only receiving a salvage value when the item does not sell in the auction, the seller's expected revenue is higher in the three-buyer first-price common-value auction without a reserve price than in the two-buyer auction with a reserve price.

Common-value auction versus posted-price selling: an agent-based model approach

Previous theoretical work has compared a private-value auction and posted-price market, and an affiliated-value auction and a posted-price market to determine the selling method preferred by sellers. Much less, however, is known about the seller’s preferred selling method when the buyers have a common value of the item. Our objective is to determine if a first-price auction or a posted-price market provides a seller with the larger expected revenue when buyers have a common value of the item being sold. An agent-based posted-price market and an agent-based first-price common-value auction with a reserve price are developed to compare these selling methods. Holding the buyers’ uncertainty about the value of the item constant, the seller prefers the posted-price market when the seller has no uncertainty about the item’s value. When the seller has an equal level of uncertainty as the buyers, the seller’s expected revenue for each market is similar. As the seller’s uncertainty increases beyond the level of the buyers’ uncertainty, the auction with a reserve price eventually becomes the preferred choice.

Looking smart versus playing dumb in common-value auctions

I compare the value of information acquired secretly with information acquired openly prior to a first-price common-value auction. Novel information (information which is independent of the other bidder’s private information) is more valuable when learned openly, but redundant information (information the other bidder already has) is more valuable when learned covertly. In a dynamic game where a bidder can credibly signal he is well-informed without disclosing the content of his information, always signaling having novel information, and never signaling having redundant information, is consistent with (but not uniquely predicted by) equilibrium play. Full revelation of any information possessed by the seller increases expected revenue and is uniquely predicted in equilibrium.

Super-Experienced Bidders in First-Price Common-Value Auctions: Rules of Thumb, NASH Equilibrium Bidding, and the Winner's Curse

Super-experienced bidders have learned to overcome the winner's curse but still earn less than 50% of Nash equilibrium profits. Subjects deviate from the complicated Nash strategy, employing piecewise-linear bid functions that are capable, in principle, of generating an equilibrium with average profits at or above the Nash benchmark. Thus, limited computational abilities alone cannot account for the reduced earnings. Further, subjects are far from best responding within this family of piecewise-linear bid functions. Alternative factors contributing to these reduced earnings are explored.

Common Value Auctions with Insider Information

Bidding is studied in first-price common value auctions where an insider is better informed than other bidders (outsiders) about the value of the item. With inexperienced bidders, having an insider does not materially reduce the severity of the winner's curse compared to auctions with a symmetric information structure (SIS). In contrast, super-experienced bidders, who have largely overcome the winner's curse, satisfy the comparative static predictions of equilibrium bidding theory: (i) average seller's revenue is larger with an insider than in SIS auctions, (ii) insiders make substantially greater profits, conditional on winning, than outsiders, and (iii) insiders increase their bids in response to more rivals. Further, changes in insiders' bids are consistent with directional learning theory (Selten and Buchta (1994)).

An Asymptotic Solution for Sealed Bid Common-Value Auctions with Bidders Having Asymmetric Information

We investigate a first-price common-value auction where bidders have asymmetric information about an item of unknown value. We compute the unique Nash equilibrium when the bidders are constrained to translation-invariant bid functions. Further, this profile of bid functions is also an asymptotic Nash equilibrium (without the constraint on the bidders' strategies) as the a priori distribution of the true value becomes increasingly diffuse. All bidders have positive expected profits at equilibrium. In the second-price analogue with two bidders there is a continuum of Nash equilibria in which both bidders have positive expected profits. Journal of Economic Literature Classification Number: C7.

Learning in common value auctions: Some initial observations

Inexperienced bidders in first-price common value auctions suffer from a winner's curse — losing money on average. With experience bidders approximate the Nash equilibrium. The mechanisms underlying this adjustment are (1) a market selection effect as the most aggressive bidders are less likely to return for subsequent sessions and (2) players who lose money bid less (experiential learning) and those who would have lost money had they won the auction with the high bidder's signal bid less (observational learning).