Exploring pricing rules in combinatorial sealed-bid auctions

The allocation of public goods such as the radio spectrum is a difficult task that the government must face. Currently, auctions are becoming an important tool to deal with this duty. In this context, the rules that the auctioneer establishes are particularly relevant, as the final outcome depends on them. When auctioning many related items, such as spectrum licenses, the bidders’ values for one item may depend on the number of items already obtained (complements and substitutes items). In such circumstances, combinatorial auctions are the most appropriate alternative for allocating lots. This paper analyzes the implications of selecting a particular pricing mechanism on the final result in a combinatorial sealed-bid auction. The following pricing rules are selected: the first-price mechanism, the Vickrey–Clarke–Groves (VCG) mechanism, and the bidder–Pareto–optimal (BPO) core mechanism, a core-selecting auction. To test these pricing rules, a simulator of the auction model has been developed. Then, to tackle the complex problem of simulating bidders’ behavior, a co-evolutionary system has been designed to identify improved strategies. The results revealed that the first-price mechanism yields inefficient outcomes and a notable reduction in the seller's revenues. Both the VCG and BPO mechanisms yield outcomes that are closer to the efficient allocation, and differences in revenues are affected by the presence of asymmetries.     

Allocating multiple units

Summary. This paper studies the allocation and rent distribution in multi-unit, combinatorial-bid auctions under complete information. We focus on the natural multi-unit analogue of the first-price auction, where buyers bid total payments, pay their bids, and where the seller allocates goods to maximize his revenue. While there are many equilibria in this auction, only efficient equilibria remain when the truthful equilibrium restriction of the menu-auction literature is used. Focusing on these equilibria we first show that the first-price auction just described is revenue and outcome equivalent to a Vickrey auction, which is the multi unit analogue of a second-price auction. Furthermore, we characterize these equilibria when valuations take a number of different forms: diminishing marginal valuations, increasing average valuations, and marginal valuations with single turning points. Received: December 23, 1999; revised version: December 10, 2001     

Second chance offers in auctions

This paper examines situations in which a seller might make a second chance (take-it-or-leave-it) offer to a non-winning bidder at a price equal to their bid at auction. This study is motivated by the take-it-or-leave-it second chance offer rules used by eBay and a number of state procurement agencies. Equilibrium bidder behavior is determined for IPV sealed bid first price, second price, English, and Vickrey auctions when a second chance offer will be made with an exogenous probability $p$ . In all but the Vickrey auction (which elicits the dominant strategy of bidding one’s value) equilibrium bids are lower than if there were no possibility of a second chance offer and higher than if a second chance offer will be made for certain. Further, the possibility of a second chance offer erodes the strategic equivalence between second price bids and English auction drop out levels. If bidders are risk averse (with CRRA preferences), this difference leads to expected revenue dominance of the second price over the English auction, both of which dominate the Vickrey auction. The first price auction is also shown to revenue dominate the Vickrey auction, and moreover, numerical results and intuition from existing literature suggest that the first price auction revenue dominates the second price auction.     

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.     

Optimal shill bidding in the VCG mechanism

This paper studies shill bidding in the Vickrey?CClarke?CGroves (VCG) mechanism applied to combinatorial auctions. Shill bidding is a strategy whereby a single decision-maker enters the auction under the guise of multiple identities (Yokoo et?al. Games Econ Behav, 46?pp. 174?C188, 2004). I formulate the problem of optimal shill bidding for a bidder who knows the aggregate bid of her opponents. A key to the analysis is a subproblem??the cost minimization problem (CMP)??which searches for the cheapest way to win a given package using shills. An analysis of the CMP leads to several fundamental results about shill bidding: (i) I provide an exact characterization of the aggregate bids b such that some bidder would have an incentive to shill bid against b in terms of a new property Submodularity at the Top; (ii) the problem of optimally sponsoring shills is equivalent to the winner determination problem (for single minded bidders)??the problem of finding an efficient allocation in a combinatorial auction; (iii) shill bidding can occur in equilibrium; and (iv) the problem of shill bidding has an inverse, namely the collusive problem that a coalition of bidders may have an incentive to merge (even after competition among coalition members has been suppressed). I show that only when valuations are additive can the incentives to shill and merge simultaneously disappear.     

Characterizing the Vickrey combinatorial auction by induction

This note studies the allocation of heterogeneous commodities to agents whose private values for combinations of these commodities are monotonic by inclusion. This setting can accommodate the presence of complementarity and substitutability among the heterogeneous commodities. By using induction logic, we provide an alternative proof of Holmstrom’s (Econometrica 47:1137–1144, 1979) characterization of the Vickrey combinatorial auction as the unique efficient, strategy-proof, and individually rational allocation rule on a smoothly connected domain of value profiles. Our approach is elementary, not involving smoothness, and intuitive in the sense that familiar properties of the single-item second-price auction provide the first step in our induction on the number of auctioned items. Moreover, our method of proof can be applied to domains which may not be smoothly connected, including nonconvex ones. The authors acknowledge the helpful comments of anonymous referee. Serizawa greatly benefited from discussion with Rajat Deb.     

BIDS AND COSTS IN COMBINATORIAL AND NONCOMBINATORIAL PROCUREMENT AUCTIONS—EVIDENCE FROM PROCUREMENT OF PUBLIC CLEANING CONTRACTS

Combinatorial procurement auctions enable suppliers to pass their potential cost synergies on to the procuring entity and may therefore lead to lower costs and enhance efficiency. However, bidders might find it profitable to inflate their stand‐alone bids in order to favor their package bids. Using data from standard and combinatorial procurement auctions, we find that bids on individual contracts in simultaneous standard auctions without the option to submit package bids are significantly lower than the corresponding stand‐alone bids in combinatorial auctions. Further, no significant difference in procurer's cost as explained by auction format is found. (JEL D44, H57, L15)     

Worst-case optimal redistribution of VCG payments in multi-unit auctions

For allocation problems with one or more items, the well-known Vickrey–Clarke–Groves (VCG) mechanism (aka Clarke mechanism, Generalized Vickrey Auction) is efficient, strategy-proof, individually rational, and does not incur a deficit. However, it is not (strongly) budget balanced: generally, the agents' payments will sum to more than 0. We study mechanisms that redistribute some of the VCG payments back to the agents, while maintaining the desirable properties of the VCG mechanism. Our objective is to come as close to budget balance as possible in the worst case. For auctions with multiple indistinguishable units in which marginal values are nonincreasing, we derive a mechanism that is optimal in this sense. We also derive an optimal mechanism for the case where we drop the non-deficit requirement. Finally, we show that if marginal values are not required to be nonincreasing, then the original VCG mechanism is worst-case optimal.     

Vickrey auctions with reserve pricing

Summary. We generalize the Vickrey auction to allow for reserve pricing in a multi-unit auction with interdependent values. In the Vickrey auction with reserve pricing, the seller determines the quantity to be made available as a function of the bidders' reports of private information, and then efficiently allocates this quantity among the bidders. Truthful bidding is a dominant strategy with private values and an ex post equilibrium with interdependent values. If the auction is followed by resale, then truthful bidding remains an equilibrium in the auction-plus-resale game. In settings with perfect resale, the Vickrey auction with reserve pricing maximizes seller revenues.Received: 31 December 2002, Revised: 5 May 2003, JEL Classification Numbers: D44, C78, D82.Correspondence to: Lawrence M. AusubelThe authors gratefully acknowledge the generous support of National Science Foundation Grants SES-97-31025, SES-01-12906 and IIS-02-05489. We appreciate valuable comments from Ilya Segal. Special thanks go to Mordecai Kurz, who served as Larry's dissertation advisor and who introduced both authors to the economics profession back at IMSSS at Stanford. Congratulations and best wishes are extended to Mordecai and his family on the happy occasion of the publication of Assets, Beliefs, and Equilibria in Economic Dynamics: Essays in Honor of Mordecai Kurz, in which this article also appears.     

Bidding behavior in competing auctions: Evidence from eBay

Much of the existing auction literature treats auctions as running independently of one another, with each bidder choosing to participate in only one auction. However, in many online auctions, a number of substitutable goods are auctioned concurrently and bidders can bid on several auctions at the same time. Recent theoretical research shows how bidders can gain from the existence of competing auctions, the current paper providing the first empirical evidence in support of competing auctions theory using online auctions data from eBay. Our results indicate that a significant proportion of bidders do bid across competing auctions and that bidders tend to submit bids on auctions with the lowest standing bid, as the theory predicts. The paper also shows that winning bidders who cross-bid pay lower prices on average than winning bidders who do not.     

An Optimal Auction for Complements

This paper considers the optimal selling mechanism for complementary items. When buyers are perfectly symmetric, the optimal procedure is to bundle the items and run a standard auction. In general, however, bundling the items is not necessarily desirable, and the standard auctions do not maximize revenue. Moreover, the optimal auction allocation may not be socially efficient since the auction must discriminate against bidders who have strong incentives to misrepresent their true preferences.Journal of Economic LiteratureClassification Number: D44.     

Evaluation of a Truthful Revelation Auction in the Context of Energy Markets with Nonconcave Benefits

We describe a Vickrey-Clarke-Groves auction for supply and demand bidding in the face of market power and nonconcave benefits in which bidders are motivated to bid truthfully, and evaluate its use for power and gas pipeline capacity auctions. The auction efficiently allocate resources if firms maximize profit. Simulations, including an application to the PJM power market, illustrate the procedure. However, the auction has several undesirable properties. It risks being revenue deficient, can be gamed by cooperating suppliers and consumers, and is subject to the information revelation and bid-taker cheating concerns that make single item Vickrey auctions rare.     

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.     

Auctions in which losers set the price

We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers' bids. In particular, we show that the kth price auction generates higher revenue than the second-price auction, for all k>2. If rationing is allowed, with shares of the asset rationed among the t highest bidders, then the (t+1)st price auction yields the lowest revenue among all auctions with rationing in which only the winners pay and the unit price only depends on the losers' bids. Finally, we compute bidding functions and revenue of the kth price auction, with and without rationing, for an illustrative example much used in the experimental literature to study first-price, second-price and English auctions.     

Multiunit Pay‐Your‐Bid Auction with One‐Dimensional Multiunit Demands*

An arbitrary number of units of a good is sold to two bidders through a discriminatory auction. The bidders are homogeneous ex ante and their demand functions are two‐step functions that depend on a single parameter. We characterize the symmetric Bayesian equilibrium and prove its existence and uniqueness. We compare this equilibrium with the equilibrium of the multiunit Vickrey auction and with the equilibria of the single‐unit first price and second price auctions. We examine the consequences of bundling all units into one package. We study the impacts that variations of the “relative” supply have on the equilibrium, on the bidders' average payoffs per unit, and on the efficiency of the equilibrium allocation.     

Bidding in private-value auctions with uncertain values

Auctions are often used to sell idiosyncratic goods difficult for potential bidders to value ex ante. Laboratory auctions with uncertainty over final values in this experiment resulted in 18% and 27% of bids above the expected value of the item in private-value first-price and English auctions, respectively. Risk-seeking preferences as measured on an individual decision task cannot explain overbidding and the first-price auction results suggest that risk aversion may not be a good explanation for bidding behavior observed with certain values. Several candidate explanations fail to explain overbidding, rather it appears to stem from some bidders who are prone to overbidding. Relative to first-price auctions, the size and frequency of overbids are significantly larger in English auctions, while more English auctions are won by overbidders. Differences between the formats appear to be driven by the dynamic nature of English auctions which is consistent with popular notions of “auction fever.”     

Vickrey allocation rule with income effect

We consider situations in which a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. In this paper, we establish that on domains that include nonquasi-linear preferences—preferences exhibiting income effects—an allocation rule that satisfies Pareto-efficiency, strategy-proofness, individual rationality, and nonnegative payment uniquely exists, which is the Vickrey allocation rule. H. Saitoh is a JSPS Research Fellow.     

Lottery or waiting-line auction?

This paper studies the efficiencies of the two most widely used non-price allocation mechanisms: lotteries and waiting-line auctions. As our analysis suggests, in addition to the fairness of the mechanism, the use of lotteries in lieu of waiting-line auctions can be also justified from an efficiency point of view. In particular, we show that the less dispersed consumers’ time valuations are, the more efficient is a lottery relative to a waiting-line auction. In addition, we identify four conditions under which a lottery dominates a waiting-line auction in expected social surplus preserving. Furthermore, the numerical simulations we conduct indicate that over a predominantly wide range of circumstances, a lottery is more socially efficient than a waiting-line auction as an allocative mechanism in the absence of a conventional price system.     

Competitive auctions

We study a class of single-round, sealed-bid auctions for an item in unlimited supply, such as a digital good. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e. encourages bidders to bid their true valuations) and on all inputs yields profit that is within a constant factor of the profit of the optimal single sale price. We justify the use of optimal single price profit as a benchmark for evaluating a competitive auctions profit. We exhibit several randomized competitive auctions and show that there is no symmetric deterministic competitive auction. Our results extend to bounded supply markets, for which we also give competitive auctions.     

Auctions and Regulation: Reengineering of Regulatory Mechanisms**

The FCC auctions, beginning in July 1994, were a watershed event in what may be best called reengineering regulation. It was the first time a new market mechanism, in the form of an auction, had been developed especially to replace traditional administrative procedures for regulating access to a natural resource. The spectrum auctions, and the soon to follow trading in SO₂ emission rights were the two initial instances in which game theory, and more specifically auction theory, played an essential role in the design of an market-based allocation process. The FCC developed a novel auction format for the spectrum auctions. The replacing of administrative regulatory processes with market mechanisms is a major innovation in regulation, or perhaps more accurately, deregulation.