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.     

The effect of corruption on bidding behavior in first-price auctions

When the owner of an object sells it through an auction run by an agent of hers, corruption may appear. In a first-price auction, corruption can make honest bidders more or less aggressive, or their behavior can remain unchanged. We identify sufficient conditions for each of the three possibilities. We analyze the effects of corruption on efficiency, bidders’ welfare and expected revenue. Our results apply as well to the situation—unrelated to corruption—where one of the bidders is granted a right of first refusal.     

On optimal head starts in all-pay auctions

We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer’s objective is to maximize a convex combination of the expected highest effort and the expected aggregate effort. Unless the weight on the highest effort is one, small head starts are always worse than no head start. Moreover, the optimal head start is strictly positive if and only if the weight on the highest effort is large enough.     

Asymmetric first-price menu auctions under intricate uncertainty

This paper studies asymmetric first-price menu auctions in the procurement environment where the buyer does not commit to a decision rule and asymmetric sellers have interdependent costs and statistically affiliated signals. Sellers compete in bidding a menu of contracts, where a contract specifies a vector of characteristics and a payment required from the buyer for delivering these characteristics. The buyer does not commit ex-ante to a decision rule but rather upon observing all the menus offered by sellers chooses the best contract. This paper establishes the existence of a continuum of separating monotone equilibria in this game bounded above by the jointly ex-post efficient outcome and below by the jointly interim efficient outcome. It shows that the jointly ex-post efficient equilibrium outcome is the only ex-post renegotiation-proof outcome and it is also ex-ante robust to all continuation equilibria.     

An elementary proof of the common maximal bid in asymmetric first-price and all-pay auctions

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.     

Art market inefficiency

Art is often used as an investment vehicle. Given the importance of market efficiency in finance, we use a large auction-based index to test whether the art market is weakly efficient. Evidence reveals that returns on artworks exhibit high positive auto-correlation. We attribute this result to price truncation resulting from unobservable reserve prices in auctions. We conclude that the art market is not efficient, mainly because price formation is opaque to outsiders who lack information on unsold artworks.     

Correlated information, mechanism design and informational rents

Crémer and McLean (Econometrica 56 (1988) 1247-1258) obtain a sufficient and necessary condition for full surplus extraction in Bayesian-Nash equilibrium—the rank condition, which McAfee and Reny (Econometrica 60(2) (1992) 395-421) later generalize for continuous type spaces. This paper shows that, if the principal does not know how noisy is the agent's signal—or equivalently, when signals available to an agent can be ranked by Blackwell's informativeness and, an agent's informativeness is independent of others’ information, the rank condition fails to hold. Conversely, when rank condition fails and informational rents are left to an agent, the model can be interpreted as if, the principal were uncertain about the informativeness of the agent's signal.     

The value of an informed bidder in common value auctions

I compare two information structures in a common value first-price auction with two bidders: In one, each of the two bidders knows only his own signal about the value of the object, and in the other, one of the bidders learns his opponent's signal as well. Gaining the additional information in the second information structure makes the informed bidder worse off if the value is submodular in the bidders' signals and better off if it is supermodular. If the value is supermodular, then the seller's revenue tends to be lower with the informed bidder than without.     

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.     

On the informational efficiency of simple scoring rules

We study information aggregation in large elections. With two candidates, efficient information aggregation is possible (e.g., Feddersen and Pesendorfer [5], [6] and [7]). We show that this result does not extend to elections with more than two candidates. We study a class of simple scoring rules in voting games with Poisson population uncertainty and three candidates. No simple scoring rule aggregates information efficiently, even if preferences are dichotomous and a Condorcet winner always exists. We introduce a weaker criterion of informational efficiency that requires a voting rule to have at least one efficient equilibrium. Only approval voting satisfies this criterion.     

On efficiency of the English auction

We study efficiency properties of the irrevocable exit English auction in a setting with interdependent values. Maskin (1992) [1] shows that the pairwise single-crossing condition is sufficient for efficiency of the English auction with two bidders and suggests that it is also a necessary condition. This paper clarifies and extends Maskin?s results to the case of N bidders. We introduce the generalized single-crossing condition—a fairly intuitive extension of the pairwise single-crossing condition—and prove that it is essentially a necessary and sufficient condition for the existence of an efficient equilibrium of the N-bidder English auction.     

On ascending Vickrey auctions for heterogeneous objects

We construct an ascending auction for heterogeneous objects by applying a primal-dual algorithm to a linear program that represents the efficient-allocation problem for this setting. The auction assigns personalized prices to bundles, and asks bidders to report their preferred bundles in each round. A bidder's prices are increased when he belongs to a “minimally undersupplied” set of bidders. This concept generalizes the notion of “overdemanded” sets of objects introduced by Demange, Gale, and Sotomayor for the one-to-one assignment problem. Under a submodularity condition, the auction implements the Vickrey-Clarke-Groves outcome; we show that this type of condition is somewhat necessary to do so. When classifying the ascending-auction literature in terms of their underlying algorithms, our auction fills a gap in that literature. We relate our results to various ascending auctions in the literature.     

Bidder collusion

We analyze bidder collusion at first-price and second-price auctions. Our focus is on less than all-inclusive cartels and collusive mechanisms that do not rely on auction outcomes. We show that cartels that cannot control the bids of their members can eliminate all ring competition at second-price auctions, but not at first-price auctions. At first-price auctions, when the cartel cannot control members’ bids, cartel behavior involves multiple cartel bids. Cartels that can control bids of their members can suppress all ring competition at both second-price and first-price auctions; however, shill bidding reduces the profitability of collusion at first-price auctions.     

ON DETAIL‐FREE MECHANISM DESIGN AND RATIONALITY*

Mechanism design theory has been criticized, because mechanisms depend on the detail of specification and agents’ behaviour relies on strong rationality assumptions. Hence the study of “detail‐free” mechanism design with weak rationality is important as a practical theory. This paper emphasizes that, even if we confine our attention to detail‐free mechanisms with weak rationality, there exists plenty of scope for the development of new and significant ideas. I describe my recent work along these lines, and argue that stochastic decisions work in large double auction environments, and that moral preferences improve the implementability of social choice functions.     

Information in conflicts

We consider two-player contests for a prize of common but uncertain value. For settings where one player knows the value of the prize, while the other only knows its prior distribution, we give conditions for when the uninformed agent is ex ante strictly more likely to win the prize than is the informed agent. In the special case of a lottery contest, equilibrium expenditures are lower under asymmetric information than if either both agents are informed or neither agent is informed.     

Paradoxical price effects on insurance markets

In this paper we analyze a paradox phenomenon in certain insurance markets of some countries: in spite of there being strong competition, increasing prices can be found in some submarkets. As a reason for this, we need to note the special distribution of insurance products, a distribution primarily based on intermediaries — and, as a result, there is an increasing part for ‘intermediation’ costs within insurance products' cost structure due to competition for the intermediaries. We build an oligopolistic model assuming that the market is saturated, which is able to explain the overemployment of intermediaries and the high commissions involved. We analyze possible interventions and laws/regulations and suggest that the problem can be solved only with major regulation. Finally, we have come up with an empirical analysis to test the model.     

Informational limitations of ascending combinatorial auctions

We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices cannot achieve social efficiency with general bidder valuations. We also show that the loss of efficiency can be severe and that only a diminishing fraction of the social welfare may be captured. This justifies the added complexity in the auctions suggested by, e.g., Parkes and Ungar (2000) [29] and Ausubel and Milgrom (2002) [2].     

Bid rotation and collusion in repeated auctions

This paper studies bidder collusion with communication in repeated auctions when no side transfer is possible. It presents a simple dynamic bid rotation scheme which coordinates bids based on communication history and enables intertemporal transfer of bidders’ payoffs. The paper derives a sufficient condition for such a dynamic scheme to be an equilibrium and characterizes the equilibrium payoffs in a general environment with affiliated signals and private or interdependent values. With IPV, it is shown that this dynamic scheme yields a strictly higher payoff to the bidders than any static collusion scheme which coordinates bids based only on the current reported signals.     

Quality cut-offs in procurement auctions

Recently the Government of India used procurement auction mechanisms with endogenously determined minimum quality. We find these auctions have no equilibrium in continuous symmetric monotonic pure strategies. This may substantiate the use of auction mechanisms with exogenously determined minimum quality.     

Matching through position auctions

Using a mechanism design framework, we characterize how a profit-maximizing intermediary can design matching markets when each agent is privately informed about his quality as a partner. Sufficient conditions are provided that ensure a version of positive assortative matching (what we call truncated positive assortative matching) maximizes profits. Under these conditions, all-pay position auctions always implement the profit-maximizing allocation. Winners-pay position auctions, however, only do so in sufficiently large markets.