Interregional Price Difference in the New Orleans Auctions Market for Slaves

Our article investigates the variation of winning bids in slave auctions held in New Orleans from 1804 to 1862. Specifically, we measure the variation in the price of slaves conditional on their geographical origin. Previous work using a regression framework ignored the auction mechanism used to sell slaves. This introduced a bias in the conditional mean of the winning bid because it depended on the number of bidders participating in the auction. Unfortunately, the number of bidders is unobserved by the econometrician.We adopt the standard framework of a symmetric independent private value auction and propose an estimation strategy to attempt to deal with this omitted variable bias. Our estimate of the mean number of bidders doubled from 1804 to 1862. We find the number of bidders had a significant positive effect on the average winning bid. An increase from 20 to 30 bidders in an auction raised the average winning bid by around 10%%. The price variation according to the geographical origin of slaves found in earlier work continues to persist after accounting for the omitted variable. We also find a new result that a considerable premium is paid for slaves originating from New Orleans. However, this price variation disappears once we account for regional productivity differences.     

Disappointment Aversion in internet Bidding-Decisions

The article presents an Internet experiment where subjects sequentially bid for basic gifts and binary-lotteries on these gifts in incentive compatible Vickrey auctions. Subjects exhibit uniformly pessimistic prize-weighting in spite of precautions to reduce suspicion and prohibit collusion. The bids for lotteries are close to the minimal payable value, even when the probability of obtaining a better prize is larger than 50%. Prize-weighting becomes even more conservative as the distance in value of payable prizes increases. The twofold aversive affect appears for three distinct groups of students; we demonstrate, however, that the same subjects overweight small win-probabilities in standard binary-choice.

---

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

Integrated-Quantile-Based Estimation for First-Price Auction Models

This article considers nonparametric estimation of first-price auction models under the monotonicity restriction on the bidding strategy. Based on an integrated-quantile representation of the first-order condition, we propose a tuning-parameter-free estimator for the valuation quantile function. We establish its cube-root-n consistency and asymptotic distribution under weaker smoothness assumptions than those typically assumed in the empirical literature. If the latter are true, we also provide a trimming-free smoothed estimator and show that it is asymptotically normal and achieves the optimal rate of Guerre, Perrigne, and Vuong (2000). We illustrate our method using Monte Carlo simulations and an empirical study of the California highway procurement auctions. Supplementary materials for this article are available online.     

Efficient Multi‐Attribute Multi‐Unit Auctions for B2B E‐Commerce Logistics

This study is the first proposing allocatively efficient multi‐attribute auctions for the procurement of multiple items. In the B2B e‐commerce logistics problem (ELP), the e‐commerce platform is the shipper generating a large number of online orders between product sellers and buyers, and third‐party logistics (3PL) providers are carriers that can deliver these online orders. This study focuses on the ELP with multiple attributes (ELP‐MA), which is generally the problem of matching the shipper's online orders and 3PL providers given that price and other attributes are jointly evaluated. We develop a one‐sided Vickrey–Clarke–Groves (O‐VCG) auction for the ELP‐MA. The O‐VCG auction leads to incentive compatibility (on the sell side), allocative efficiency, budget balance, and individual rationality. We next introduce the concept of universally unsatisfied set to construct a primal‐dual algorithm, also called the primal‐dual Vickrey (PDV) auction. We prove that the O‐VCG auction can be viewed as a single‐attribute multi‐unit forward Vickrey (SA‐MFV) auction. Both PDV and SA‐MFV auctions realize VCG payments and truthful bidding for general valuations. This result reveals the underlying link not only between single‐attribute and multi‐attribute auctions, but between static and dynamic auctions in a multi‐attribute setting.     

Weak Monotonicity Characterizes Deterministic Dominant‐Strategy Implementation

We characterize dominant‐strategy incentive compatibility with multidimensional types. A deterministic social choice function is dominant‐strategy incentive compatible if and only if it is weakly monotone (W‐Mon). The W‐Mon requirement is the following: If changing one agent's type (while keeping the types of other agents fixed) changes the outcome under the social choice function, then the resulting difference in utilities of the new and original outcomes evaluated at the new type of this agent must be no less than this difference in utilities evaluated at the original type of this agent.     

Keyword Auctions,Unit‐Price Contracts,and the Role of Commitment

Motivated by the enormous growth of keyword advertising, this paper explores the design of performance‐based unit‐price contract auctions, in which bidders bid their unit prices and the winner is chosen based on both their bids and performance levels. The previous literature on unit‐price contract auctions usually considers a static case where bidders' performance levels are fixed. This paper studies a dynamic setting in which bidders with a low performance level can improve their performance at a certain cost. We examine the effect of the performance‐based allocation on overall bidder performance, auction efficiency, and the auctioneer's revenue, and derive the revenue‐maximizing and efficient policies accordingly. Moreover, the possible upgrade in bidders' performance level gives the auctioneer an incentive to modify the auction rules over time, as is confirmed by the practice of Yahoo! and Google. We thus compare the auctioneer's revenue‐maximizing policies when she is fully committed to the auction rule and when she is not, and show that the auctioneer should give less preferential treatment to low‐performance bidders when she is fully committed.     

Can Relaxation of Beliefs Rationalize the Winner's Curse?: An Experimental Study

We use a second‐price common‐value auction, called the maximal game, to experimentally study whether the winner's curse (WC) can be explained by models which retain best‐response behavior but allow for inconsistent beliefs. We compare behavior in a regular version of the maximal game, where the WC can be explained by inconsistent beliefs, to behavior in versions where such explanations are less plausible. We find little evidence of differences in behavior. Overall, our study casts a serious doubt on theories that posit the WC is driven by beliefs.     

Precautionary Bidding in Auctions

We analyze bidding behavior in auctions when risk‐averse buyers bid for a good whose value is risky. We show that when the risk in the valuations increases, DARA bidders will reduce their bids by more than the appropriate increase in the risk premium. Ceteris paribus, buyers will be better off bidding for a more risky object in first price, second price, and English auctions with affiliated common (interdependent) values. This “precautionary bidding” effect arises because the expected marginal utility of income increases with risk, so buyers are reluctant to bid so highly. We also show that precautionary bidding behavior can make DARA bidders prefer bidding in a common values setting to bidding in a private values one when risk‐neutral or CARA bidders would be indifferent. Thus the potential for a “winner's curse” can be a blessing for rational DARA bidders.     

An Analysis of Scoring and Buyer‐Determined Procurement Auctions

In procurement auctions, the object for sale is a contract, bidders are suppliers, and the bid taker is a buyer. The suppliers bidding for the contract are usually the current supplier (the incumbent) and a group of potential new suppliers (the entrants). As the buyer has an ongoing relationship with the incumbent, he needs to adjust the bids of the entrants to include non‐price attributes, such as the switching costs. The buyer can run a scoring auction, in which suppliers compete on the adjusted bids or scores, or, he can run a buyer‐determined auction, in which suppliers compete on the price, and the buyer adjusts a certain number of the bids with the non‐price attributes after the auction to determine the winner. Unless the incumbent has a significant cost advantage over the entrants, I find that the scoring auction yields a lower average cost for the buyer, if the non‐price attributes are available. If the non‐price attributes are difficult or expensive to obtain, the buyer could run a buyer‐determined auction adjusting only the lowest price bid.     

Level‐k Auctions: Can a Nonequilibrium Model of Strategic Thinking Explain the Winner's Curse and Overbidding in Private‐Value Auctions?

This paper proposes a structural nonequilibrium model of initial responses to incomplete‐information games based on “level‐k” thinking, which describes behavior in many experiments with complete‐information games. We derive the model's implications in first‐ and second‐price auctions with general information structures, compare them to equilibrium and Eyster and Rabin's (2005) “cursed equilibrium,” and evaluate the model's potential to explain nonequilibrium bidding in auction experiments. The level‐k model generalizes many insights from equilibrium auction theory. It allows a unified explanation of the winner's curse in common‐value auctions and overbidding in those independent‐private‐value auctions without the uniform value distributions used in most experiments.