Conservation Auctions and Compliance: Theory and Evidence from Laboratory Experiments

Many agri-environmental conservation programs are faced with the problem of imperfect monitoring. This provides farmers with an incentive for noncompliance, because they can receive subsidies without implementing the conservation scheme. In this paper, bidding behavior and auction performance are compared for discriminatory-price and uniform-price auctions in an imperfect monitoring environment. Our theoretical analysis suggests that auction performances are equalized between the discriminatory-price and uniform-price auctions. However, laboratory experiments reveal that, although the discriminatory-price auction has an advantage in terms of reducing policy costs, it is more likely to cause adverse selection. As a result, the uniform-price auction tends to have higher efficiency and cost-effectiveness when compliance behavior is taken into account.     

Auctioning divisible goods

Summary. We derive equilibrium bidding strategies in divisible good auctions for asymmetrically informed risk neutral and risk averse bidders when there is random noncompetitive demand. The equilibrium bid schedules contain both strategic considerations and explicit allowances for the winner's curse. When the bidders' information is symmetric, the strategic aspects of bidding imply that there always exist equilibria of a uniform-price auction with lower expected revenue than provided by a discriminatory auction. When bidders are risk averse, there may exist equilibria of the uniform-price auction that provide higher expected revenue than a discriminatory auction. Received: November 4, 1999; revised version: March 9, 2001     

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.     

Auction theory adaptations for real life applications

We develop extensions to auction theory results that are useful in real life scenarios.1. Since valuations are generally positive we first develop approximations using the log-normal distribution. This would be useful for many finance related auction settings since asset prices are usually non-negative.2. We formulate a positive symmetric discrete distribution, which is likely to be followed by the total number of auction participants, and incorporate this into auction theory results.3. We develop extensions when the valuations of the bidders are interdependent and incorporate all the results developed into a final combined realistic setting.4. Our methods can be a practical tool for bidders and auction sellers to maximize their profits. The models developed here could be potentially useful for inventory estimation and for wholesale procurement of financial instruments and also non-financial commodities.All the propositions are new results and they refer to existing results which are stated as Lemmas.     

Auctions for social lending: A theoretical analysis

Prosper, today the second largest social lending marketplace with nearly 1.5 million members and $380 million in funded loans, employed an auction mechanism amongst lenders to finance each borrower's loan until 2010. Given that a basic premise of social lending is cheap loans for borrowers, how does the Prosper auction do in terms of the borrower's payment, when lenders are strategic agents with private true interest rates? We first analyze the Prosper auction as a game of complete information and fully characterize its Nash equilibria, and show that the uniform-price Prosper mechanism, while simple, can lead to much larger payments for the borrower than the VCG mechanism. We next compare the Prosper mechanism against the borrower-optimal auction in an incomplete information setting, and conclude by examining the Prosper mechanism when modeled as a dynamic auction, and provide tight bounds on the price for a general class of bidding strategies.     

Auctions with uncertain numbers of bidders

We investigate bidders’ and seller's responses to ambiguity about the number of bidders in the first price auction (FPA) and the second price auction (SPA) with independent private valuations. We model ambiguity aversion using the maxmin expected utility model. We find that bidders prefer the number of bidders to be revealed in the FPA, are indifferent between revealing and concealing in the SPA, and prefer the SPA to the FPA. If bidders are more pessimistic than the seller then the seller prefers to conceal the number of bidders in the FPA, and prefers the FPA to the SPA.     

Existence of equilibrium in large double auctions

We show the existence of a pure strategy, symmetric, increasing equilibrium in double auction markets with correlated, conditionally independent private values and many participants. The equilibrium we find is arbitrarily close to fully revealing as the market size grows. Our results provide strategic foundations for price-taking behavior in large markets.     

Competing auctions with endogenous quantities

Two sellers decide on their discrete supply of a homogenous good. There is a finite number of buyers with unit demand and privately known valuations. In the first model, there is a centralized market place where a uniform auction takes place. In the second, there are two distinct auction sites, each with one seller, and buyers decide where to bid. Using the theory of potential games, we show that in the one-site auction model there is always an equilibrium in pure-strategies. In contrast, if the distribution of buyers values has an increasing failure rate, and if the marginal cost of production is relatively low, there is no pure-strategy equilibrium where both sellers make positive profits in the competing sites model. We also identify conditions under which an equilibrium with a unique active site exists. We deal with the finite and discrete models by using several results about order statistics developed by Richard Barlow and Frank Proschan [R. Barlow, F. Proschan, Mathematical Theory of Reliability, Wiley, New York, 1965; R. Barlow, F. Proschan, Inequalities for linear combinations of order statistics from restricted families, Ann. Math. Statist. 37 (1966) 1593-1601; R. Barlow, F. Proschan, Statistical Theory of Reliability and Life Testing, McArdle Press, Silver Spring, 1975].     

Sequential vs. single-round uniform-price auctions

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k₁ objects are sold in the first round and k₂ in the second round, with and without revelation of the first-round winning bids. We demonstrate that auctioning objects in sequence generates a lowballing effect that reduces the first-round price. Total revenue is greater in a single-round, uniform auction for k=k₁+k₂ objects than in a sequential uniform auction with no bid announcement. When the first-round winning bids are announced, we also identify a positive informational effect on the second-round price. Total expected revenue in a sequential uniform auction with winning-bids announcement may be greater or smaller than in a single-round uniform auction, depending on the model's parameters.     

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.     

Supply function equilibria of pay-as-bid auctions

This paper characterizes the Nash equilibrium in a pay-as-bid (discriminatory), divisible-good, procurement auction. Demand by the auctioneer is uncertain as in the supply function equilibrium model. A closed form expression is derived for a one shot game. Existence of an equilibrium is ensured if the hazard rate of the demand distribution is monotonically decreasing with respect to the shock outcome and sellers have non-decreasing marginal costs. Multiple equilibria can be ruled out for markets, for which the auctioneer’s demand exceeds suppliers’ capacity with a positive probability. The derived equilibrium can be used to model strategic bidding behavior in pay-as-bid electricity auctions, such as the balancing mechanism of United Kingdom. Offer curves and mark-ups of the derived equilibrium are compared to results for the SFE of a uniform-price auction.      

Information aggregation in auctions with an unknown number of bidders

Information aggregation, a key concern for uniform-price, common-value auctions with many bidders, has been characterized in models where bidders know exactly how many rivals they face. A model allowing for uncertainty over the number of bidders is essential for capturing a critical condition for information to aggregate: as the numbers of winning and losing bidders grow large, information aggregates if and only if uncertainty about the fraction of winning bidders vanishes. It may be possible for the seller to impart this information by precommitting to a specified fraction of winning bidders, via a proportional selling policy. Intuitively, this could make the proportion of winners known, and thus provide all the information that bidders need to make winner's curse corrections.     

Mixed bundling auctions

We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which partitions are chosen in the mechanism. This class contains efficient auctions, pure bundling auctions, mixed bundling auctions, auctions with reserve prices and auctions with pre-packaged bundles. For any number of objects and bidders, both the pure bundling auction and separate, efficient auctions for the single objects are revenue-inferior to an auction that involves mixed bundling.     

Multi-unit demand auctions with synergies: behavior in sealed-bid versus ascending-bid uniform-price auctions

We construct a relatively simple model of bidding with synergies and solve it for both open outcry and sealed-bid uniform-price auctions. The essential behavioral forces involved in these auctions are: (1) A demand reduction force resulting from the monopsony power that bidders with multiple-unit demands have when synergies are relatively inconsequential, and (2) Bidding above stand-alone values in order to capture significant complementarities between units. The latter creates a potential “exposure problem,” as bidders may win only parts of a package and earn negative profits. Bidding outcomes are closer to equilibrium in clock compared to sealed-bid auctions. However, there are substantial and systematic deviations from equilibrium, with patterns of out-of-equilibrium play differing systematically between the two auction formats. These patterns of out-of-equilibrium play are analyzed, along with their effects on revenue and efficiency.     

Optimal search auctions

We study the design of profit maximizing single unit auctions under the assumption that the seller needs to incur costs to contact prospective bidders and inform them about the auction. With independent bidders’ types and possibly interdependent valuations, the seller's problem can be reduced to a search problem in which the surplus is measured in terms of virtual utilities minus search costs. Compared to the socially efficient mechanism, the optimal mechanism features fewer participants, longer search conditional on the same set of participants, and inefficient sequence of entry.     

Charity auctions with multiple goods: Bidding behavior and revenue

In a charity auction with multiple goods, we show that the highest-losing bid uniform price auction revenue dominates its lowest-winning bid counterpart. Only in the highest-losing bid uniform price auction is bidding independent of the number of goods and players and revenue increasing in the number of goods.     

Multi-unit demand auctions with synergies: behavior in sealed-bid versus ascending-bid uniform-price auctions

We construct a relatively simple model of bidding with synergies and solve it for both open outcry and sealed-bid uniform-price auctions. The essential behavioral forces involved in these auctions are: (1) A demand reduction force resulting from the monopsony power that bidders with multiple-unit demands have when synergies are relatively inconsequential, and (2) Bidding above stand-alone values in order to capture significant complementarities between units. The latter creates a potential “exposure problem,” as bidders may win only parts of a package and earn negative profits. Bidding outcomes are closer to equilibrium in clock compared to sealed-bid auctions. However, there are substantial and systematic deviations from equilibrium, with patterns of out-of-equilibrium play differing systematically between the two auction formats. These patterns of out-of-equilibrium play are analyzed, along with their effects on revenue and efficiency.     

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.     

Learning by investing

We test for learning among heterogeneous individuals who are engaged in bidding and who possess limited information about the auctioned assets. We use an extensive dataset taken from an auction through which state‐owned enterprises were privatized in the Czech Republic in 1993–94. To test for learning, we develop new measures of individual performance to accommodate the varying prices of assets available in six successive stages of bidding. We present evidence that learning took place among heterogeneous agents during a large‐scale multi‐stage auction that is unique in terms of its size, incentives and variation. The auction’s design, with multiple market periods, allowed agents to learn based on accumulated experience. As individuals had to pay a fee to participate, and as the potential gain was in the magnitude of several months’ salary, we conclude that large incentives were driving our results.     

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.