Reserve price signaling

In a general auction model in which bidders’ signals are affiliated, we characterize the unique separating equilibrium in which the seller can use reserve prices to credibly signal her private information. When the buyers’ signals are independent, the optimal reserve price is shown to be increasing in the number of bidders under certain conditions. We also demonstrate that the probability that the item is sold at the reserve price can increase as the number of bidders increases, which indicates a more central role for reserve prices than perceived in the standard auction models.     

Equilibrium reserve prices in sequential ascending auctions

We study a model where bidders have perfectly correlated valuations for two goods sold sequentially in two ascending-price auctions. The seller sets a reserve price before the beginning of each auction. Despite the lack of commitment by the seller, we characterize an equilibrium and study its properties. Strategic non-disclosure of information takes the form of non-participation in the early auction by low-valuation bidders, while high-valuation bidders bid up to their true valuations. Some buyers who would profitably buy at the reserve price refrain from participating in order to decrease the second-auction reserve price.     

A non-expected utility model and its application in practical auctions

ABSTRACT

This article presents a non-expected utility decision model which is nonlinear in the winning probabilities. The model not only explicitly expresses bidders’ attitudes to risk, but also addresses their preference over the bidding criteria. To demonstrate how to apply the model in the practical auction design, the first- and second-price auctions with both commission rate and reserve price are examined, respectively. For nonrisk-neutral bidders, the equilibrium bidding strategies are characterized, in which the commission rate has a significant influence on the bidding strategy through the critical valuation. However, the existence of the optimal commission rate is uncertain, but once it exists, it depends on the information rent of the highest or second highest order valuation in terms of the inverse hazard rate. With risk-aversion bidders, the only difference to the optimal reserve price is a constant between the first- and second-price auctions. The revenue comparisons show that the classical Revenue Equivalence Theorem fails in practical auctions with the commission rate. This article extends the application of the decision-making model in the auction design in theory and provides some guidance for the auction house and the seller to make their decisions in reality.     

Auction and the informed seller problem

A seller possessing private information about the quality of a good attempts to sell it through a second-price auction with announced reserve price. The choice of a reserve price transmits information to the buyers. We characterize the equilibria with monotone beliefs of the resulting signaling game and show that they lead to a reduced probability of selling the good compared to the symmetric information situation. We compare the unique separating equilibrium of this signaling game to the equilibrium of a screening game in which an uninformed monopoly broker chooses the trading mechanism. We show that the ex ante expected probability of trade may be larger with a monopoly broker, as well as the ex ante total expected surplus.     

Charitable asymmetric bidders

Recent papers show that the all‐pay auction is better at raising money for charity than the first‐price auction with symmetric bidders under incomplete information. Yet, this result is lost with sufficiently asymmetric bidders under complete information. In this paper, we consider a framework on charity auctions with asymmetric bidders under some incomplete information. We find that the all‐pay auction still raises more money than the first‐price auction. Thus, the all‐pay auction should be seriously considered when one wants to organize a charity auction.     

First-price auctions with resale: the case of many bidders

We study first-price auctions with resale when there are many bidders and derive existence and characterization results under the assumption that the winner of the initial auction runs a second-price auction with an optimal reserve price. The fact that symmetrization fails when there are more than two bidders has been observed before, but we also provide the direction: weaker bidders are less likely to win than stronger ones. For a special class of distributions and three bidders, we prove that the bid distributions are more symmetric with resale than without. Numerical simulations suggest that the more bidders there are, the more similar the allocation is to the case without resale, and thus, the more asymmetric the bid distributions are between strong and weak bidders. We also show in an example that the revenue advantage of first-price auctions over second-price auctions is positive, but decreasing in the number of bidders.     

Sequential negotiations with costly information acquisition

Negotiations about a merger or acquisition are often sequential and only partially disclose to bidders information about each otherʼs bids. This paper explains the seller optimality of partial disclosure in a single-item private-value auction with two bidders. Each bidder can inspect the item at a nonprohibitive cost. If a revenue-maximizing seller cannot charge bidders for the information about the otherʼs bid, then the seller optimally runs a sequential second-price auction with a reserve price and a buy-now price. The seller prefers to keep the bids confidential and, sometimes, to hide the order in which he approaches the bidders.     

Sequentially Optimal Auctions

In auctions where a seller can post a reserve price but if the object fails to sell cannot commit never to attempt to resell it, revenue equivalence between repeated first price and second price auctions without commitment results. When the time between auctions goes to zero, seller expected revenues converge to those of a static auction with no reserve price. With many bidders, the seller equilibrium reserve price approaches the reserve price in an optimal static auction. An auction in which the simple equilibrium reserve price policy of the seller mirrors a policy commonly used by many auctioneers is computed.Journal of Economic LiteratureClassification Numbers: C78, D44, D82.     

Imperfect Competition in Auction Designs

We study the competition between two owners of identical goods who wish to sell them to a pool of potential buyers. The sellers compete simultaneously setting reserve prices for their second price sealed bid auctions. Upon observing the set reserve prices, the buyers decide simultaneously in which auction to bid. We show that this game has (at least) one equilibrium and that all equilibria are inefficient: reserve prices are not driven to zero (cost). We also discuss where and why the parallel between optimal auction design and optimal pricing in the case of monopoly breaks down for oligopoly.     

Auctions with a buy price: The case of reference-dependent preferences

In an auction with a buy price, the seller provides bidders with an option to end the auction early by accepting a transaction at a posted price. This paper develops a model of an auction with a buy price in which bidders use the auction's reserve price and buy price to formulate a reference price. The model both explains why a revenue-maximizing seller would want to augment her auction with a buy price and demonstrates that the seller sets a higher reserve price when she can affect the bidders' reference price through the auction's reserve price and buy price than when she can affect the bidders' reference price through the auction's reserve price only. The comparative statics properties of bidding behavior are in sharp contrast to equilibrium behavior in other models where the existence and size of the auction's buy price have no effect on bidding behavior.     

Strategic ignorance in a second-price auction

Suppose that bidders may publicly choose not to learn their values prior to a second-price auction with costly bidding. All equilibria with truthful bidding exhibit bidder ignorance when the number of bidders is sufficiently small. Ignorance considerations also affect the optimal reserve price.     

Reserve Prices without Commitment

When potential bidders in an auction have to incur a cost to prepare their bids and thus to learn their valuations, imposing a reserve price and announcing that in case no bid is submitted there will be another auction without a reserve price is both revenue and welfare improving. Reserve prices that induce less than maximum entry in the first auction may be optimal. Also, entry fees are not necessarily better instruments than reserve prices.Journal of Economic LiteratureClassification Number: D44.     

Information structures in optimal auctions

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal information structures in an optimal auction exhibit a number of properties: (i) information structures can be represented by monotone partitions, (ii) the cardinality of each partition is finite, (iii) the partitions are asymmetric across agents. We show that an optimal information structure exists.     

REPUTATIONAL BIDDING

We consider auctions where bidders care about the reputational effects of their bidding and argue that the amount of information disclosed at the end of the auction will influence bidding. We focus on bid disclosure rules that capture all of the realistic cases. We show that bidders distort their bidding in a way that conforms to stylized facts about takeovers/licence auctions. We rank the disclosure rules in terms of their expected revenues and find that, under certain conditions, full disclosure will not be optimal. First‐price and second‐price auctions with price disclosure are not revenue equivalent and we rank them.     

Competition among auctioneers in large markets

We analyse a multistage game of competition among auctioneers. First, the auctioneers commit to some reserve prices; second, the bidders enter one auction, if any; and finally, the auctions take place. We show that for any finite set of feasible reserve prices, each auctioneer announces a reserve price equal to his production cost if the numbers of auctioneers and bidders are sufficiently large, though finite. Our result supports the idea that optimal auctions may be quite simple. Our model also confirms previous results for some “limit” versions of the model by McAfee (Econometrica 61 (1993) 1281-1312), Peters (Rev. Econ. Stud. 64 (1997) 97-123), and Peters and Severinov (J. Econ. Theory 75 (1997) 141-179).     

网络团购拍卖中竞标者队列研究

通过分析网络团购拍卖机制下的竞标者等待达到拍卖保留价格现象,提出网络团购拍卖过程中存在竞标者队列,并揭示了竞标者队列的性质及其对网络团购拍卖机制设计的影响。研究指出:网络团购拍卖存在较大数量的成功竞标者,这些成功竞标者因需等待拍卖最终成交而形成竞标者队列;拍卖方对竞标者队列进行的服务与成批服务的排队系统相似,但也存在差异;拍卖方可优化网络团购拍卖机制,以保证获得拍卖收益,并减少在服务过程中出现的队列拥塞现象的发生。     

CHARITY AUCTIONS*

In a charity auction the public‐goods nature of auction revenue affects bidding incentives. We compare equilibrium bidding and revenue in first‐price, second‐price, and all‐pay charity auctions. Bidding revenue typically varies by selling format. First‐price auctions are less lucrative than second‐price and all‐pay auctions, and with sufficiently many bidders the all‐pay auction has the highest bidding revenue. However, revenue equivalence applies when the auctioneer can set a reserve price and fees plus threaten to cancel the auction. If the auctioneer cannot threaten cancellation, a reserve and bidding fee can augment revenue but again revenue varies by auction format     

Multi-unit auctions with private information: an indivisible unit continuous price model

We construct a model of multi-unit auctions in which I bidders bid for two indivisible units of a common value good. Using a first-order approach, we find that there are equilibria in which bidders bid the same price for both units in the discriminatory auction, but not in the uniform auction. When there are only two bidders, under certain conditions, there are linear equilibria for both the discriminatory and the uniform auction formats. In all equilibria, bidders equalize the expected marginal benefit of bidding to the marginal costs of bidding. We show that comparison of the seller??s expected revenue across auction formats depends only on the ratio of the precision of private information to the precision of public information.     

Profit Maximizing in Auctions of Public Goods

A profit-maximizing auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group only if the sum of their bids exceeds a reserve price declared previously by the auctioneer. For the two-bidder case with private values drawn from a uniform distribution we characterize the continuously differentiable symmetric equilibrium bidding functions for the agents, and we find the optimal reserve price for the auctioneer when such functions are used by the bidders. We also examine another interesting family of equilibrium bidding functions for this case, with a discrete number of possible bids, and show the relation (in the limit) to the differentiable bidding functions.     

All equilibria of the Vickrey auction

This paper characterizes the set of Nash equilibria in the second-price sealed-bid auction with independent private values and three or more bidders. In addition, we show that any effective reserve price implies uniqueness.