Asymmetric first price auctions

A new approach to asymmetric first price auctions is proposed which circumvents the need to examine bidding strategies directly. Specifically, the ratio of bidders' (endogenous) payoffs is analyzed and compared to the ratio of the (exogenous) distribution functions that describe beliefs. Most of the results are inferred from this comparison. In the existing theoretical literature, assumptions of first order stochastic dominance or stronger imply that the latter ratio has very specific properties, but no such assumptions are imposed here. It is proven that first order stochastic dominance is necessary for bidding strategies not to cross. When this assumption is relaxed in the numerical literature it is done in a manner that leads to exactly one crossing. However, it is straightforward to construct examples with several crossings. Finally, bid distributions will cross in auctions with two bidders whenever second order (but not first order) stochastic dominance applies.     

A comparison of first price multi-object auctions

We compare simultaneous multi-object English-type ascending price auctions with first price sealed bid auctions in private values environments with multi-object demands. Special attention is paid to the effect of closing rules on ascending auctions’ outcomes. We find that simultaneous ascending auctions with the soft closing rule are the most efficient, while the sealed bid auctions generate the highest revenue. Ascending auctions with the hard closing rule display a significant amount of late bidding, resulting in the lowest among the three institutions revenue and efficiency.

---

Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.      

Ascending price Vickrey auctions

We show that an ascending price auction for multiple units of a homogeneous object proposed by Ausubel (i) raises prices for packages until they reach those nonlinear and non-anonymous market clearing prices at which bidders get their marginal products and (ii) the auction is a primal–dual algorithm applied to an appropriate linear programming formulation in which the dual solution yields those same market clearing prices. We emphasize the similarities with efficient incentive compatible ascending price auctions to implement Vickrey payments when there is a single object or when objects are heterogeneous but each buyer does not desire more than one unit. A potential benefit of these common threads is that it helps to establish the principles upon which Vickrey payments may be implemented through decentralized, incentive compatible procedures.     

Continuity of the first price auction Nash equilibrium correspondence

Summary. Despite the complexity of the first price auction in the general asymmetric case, analytical results have started to emerge in the literature. Authors have also searched to gain insights by computing numerical estimates of the equilibria for some probability distributions of the valuations. This paper proves that the Nash equilibrium of the first price auction depends continuously, for the weak topology, on the valuation distributions and thus brings robustness to the numerical results as well as some theoretical results. As an example of application, we disprove a conjecture of comparative statics. Received: February 1, 1999; revised version: July 27, 2001     

Strategic price discounting and rationing in uniform price auctions

I modify the uniform-price auction rules in allowing the seller to ration bidders. This allows me to provide a strategic foundation for underpricing when the seller has an interest in ownership dispersion. Moreover, many of the so-called “collusive-seeming” equilibria disappear.     

Uniqueness of equilibrium in sealed high-bid auctions

For the case of two buyers we show that equilibrium in the sealed high-bid auction is unique when (i) buyers' reservations prices are drawn independently from distributions with finite support and positive mass at the lower endpoint; (ii) buyers have private values; and (iii) buyers' preferences are log supermodular. For more than two buyers, we obtain the same result under the additional assumptions that (iv) buyers with the same reservation price have the same preferences; (v) buyers are risk neutral or risk averse with non-increasing absolute risk aversion; and (vi) the supports of the different buyers' distributions of reservation prices have the same upper endpoint.     

Asymmetric Nash equilibrium in emission rights auctions

This paper studies the problems of emission rights auctions, and presents a uniform price auction mechanism based on three assumptions, i.e., all buyers are asymmetric, every buyer submits a nonincreasing continuous demand function, and every buyer's valuation to per unit of the emission rights is common value information. It focuses on solving the asymmetric Nash equilibrium for this auction mechanism. It concludes that there exist multiple Nash equilibria in our auction mechanism, but the arbitrary low equilibrium prices cannot emerge. We also give several suggestions on how to induce the auction to a desired ideal equilibrium state in mechanism design of emission rights auctions.     

Bribing and signaling in second price auctions

We examine whether a two-bidder, second-price auction for a single good (with private, independent values) is immune to a simple form of collusion, where one bidder may bribe the other to commit to stay away from the auction (i.e. submit a bid of zero). In either of two cases—where the potential bribe is fixed or allowed to vary—the only robust equilibria involve bribing. In the fixed-bribe case, there is a unique such equilibrium. In the variable bribes case, all robust equilibria involve low briber-types revealing themselves through the amount they offer, while all high types offer the same bribe; only one such equilibrium is continuous. Bribing in all cases causes inefficiency.     

Equilibria in second price auctions with participation costs

We investigate equilibria of sealed-bid second price auctions with bidder participation costs in the independent private values environment. We focus on equilibria in cutoff strategies (participate and bid the valuation iff it is greater than the cutoff), since if a bidder finds it optimal to participate, she cannot do better than bidding her valuation. When bidders are symmetric, concavity (strict convexity) of the cumulative distribution function from which the valuations are drawn is a sufficient condition for uniqueness (multiplicity) within this class. We also study a special case with asymmetric bidders and show that concavity/convexity plays a similar role.     

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.     

On the informational inefficiency of discriminatory price auctions

We analyze bidding behavior in large discriminatory-price auctions in a common value setting where the number of objects is a non-trivial proportion of the number of bidders. We show that the average price paid in the auction is biased downward from the expected value of the objects, even in the competitive limit. We show that conditional on a signal that falls below a threshold, a bidder bids no more than the expected value of an object conditional on the signal and winning; while conditional on any signal that lies above the threshold the bid is strictly lower than the expected value conditional on the signal and winning.     

Substitute goods, auctions, and equilibrium

This paper identifies two notions of substitutes for auction and equilibrium analysis. Weak substitutes, the usual price-theory notion, guarantees monotonicity of tâtonnement processes and convergence of clock auctions to a pseudo-equilibrium, but only strong substitutes, which treats each unit traded as a distinct good with its own price, guarantees that every pseudo-equilibrium is a Walrasian equilibrium, that the Vickrey outcome is in the core, and that the “law of aggregate demand” is satisfied. When goods are divisible, weak substitutes along with concavity guarantees all of the above properties, except for the law of aggregate demand.     

Ascending price Vickrey auctions for general valuations

Ascending price auctions involving a single price path and buyers paying their final bid price cannot achieve the Vickrey-Clarke-Groves (VCG) outcome in the combinatorial auctions setting. Using a notion called universal competitive equilibrium prices, shown to be necessary and sufficient to achieve the VCG outcome using ascending price auctions, we define a class of ascending price auctions in which buyers bid on a single price path. Truthful bidding by buyers is an ex post Nash equilibrium in such auctions. By giving discounts to buyers from the final price, the VCG outcome is achieved for general valuations.     

Towards equilibrium offers in unit commitment auctions with nonconvex costs

We compare two types of uniform-price auction formats commonly used in wholesale electricity markets—centrally committed and self-committed markets. Auctions in both markets are conducted by an independent system operator that collects generator bids and determines which generators will operate and how much electricity each will produce. In centrally committed markets, generators submit two-part bids consisting of a startup cost and a variable energy cost. Self-committed markets force generators to incorporate their startup costs into a one-part energy bid. The system operator in a centrally committed system ensures that each generator recovers the startup and energy costs stated in its two-part bid, while no such guarantees are made in self-committed markets. The energy cost ranking and incentive properties of these market designs remains an open question. While the system operator can determine the most efficient dispatch with a centralized market, the auction mechanism used to solicit generator data compels generators to overstate costs. Self commitment might involve less efficient dispatch but have better incentive properties. We derive Nash equilibria for both market designs in a symmetric duopoly setting. We also derive simple conditions under which the two market designs will be expected cost-equivalent.     

Existence of equilibrium in an OLG model with production and altruistic preferences

Summary. This note deals with the existence and uniqueness of a non-trivial steady-state equilibrium in an overlapping generations (OLG) model with productive capital and altruistic agents. We establish a necessary and sufficient condition for operative bequests which extends Abel (1987) and Weil (1987). Interestingly, we prove that the OLG model with production and altruistic agents always experiences a non-trivial steady-state equilibrium. Received: July 16, 1998; revised version: January 29, 1999     

Existence,uniqueness, and stability of equilibrium in an OLG economy

Summary. This paper presents sufficient conditions for the existence of a unique and globally stable steady state equilibrium for OLG economies with production. The conditions impose separate requirements on the utility and production functions. Moreover, the conditions do not require assumptions concerning the third order derivatives of the production and utility functions.Received: 12 August 2002, Revised: 7 January 2003, JEL Classification Numbers: D50, D91, E13, O41.I would like to thank Nick Baigent, Laurie Conway, Karl Farmer, Christian Gehrke, and Hideo Konishi for helpful comments. I am grateful to an anonymous referee for his or her comments.     

Revenue in first-price auctions with a buy-out price and risk-averse bidders

Journal of Economics - We model the “Buy-It-Now or Best Offer” eBay listing option as a first-price auction with a buy-out price and consider seller revenue when bidders are...     

Second price auctions on general preference domains: two characterizations

Auction theory usually assumes the quasi-linearity of individual preferences. We drop this assumption and define an extension of second price mechanisms that applies to general preferences. It turns out that the extended second price mechanisms are the only rules satisfying efficiency, strategy-proofness, and a mild non-imposition property. Their definition is simple just as much as the definition of usual second price mechanisms: everyone reports his maximum willingness to pay and the bidder whose reported value is highest buys the auctioned object for the price equal to the second highest reported value. The characterization is valid if efficiency is replaced by envy-freeness. I gratefully acknowledge an associate editor and two anonymous referees for their very helpful comments. Hiroki Saitoh and Shigehiro Serizawa independently obtain a result that is closely related to my main result (see, Remark in Sect. 1). I thank them for sending me the paper and communication, and Yuji Fujinaka for informing me about their work. I also thank the financial support by KAKENHI (19310031).