Uniqueness of Equilibrium in Sealed High-Bid Auctions

Sealed High-Bid Auctions, Equilibrium

Binomial menu auctions in government formation

In a menu auction, players submit bids for all choices the auctioneer A can make, and A then makes the choice that maximizes the sum of bids. In a binomial menu auction (BMA), players submit acceptance sets (indicating which choices they would support), and A chooses the option that maximizes his utility subject to acceptance of the respective players. Monetary transfers may be implicit, but players may also bid by offering "favors" and the like. BMAs provide a unified representation of both monetary and non-monetary bidding, which I apply to model government formation. First, I analyze general BMAs, characterize the solution under complete information and establish outcome uniqueness (for both, sealed bid and Dutch formats). Second, in case monetary transfers are possible, BMAs are shown to implement VCG mechanisms. Finally, in case transfers are impossible, BMAs extend the model of proto-coalition bargaining and are specifically applied to government formation.menu auction; demand commitment; proto-coalition bargaining; VCG mechanism

BIDDING BEHAVIOR IN MULTI-UNIT AUCTIONS - AN EXPERIMENTAL INVESTIGATION AND SOME THEORETICAL INSIGHTS

We present laboratory experiments of five different multi-unit auction mechanisms. Two units of a homogeneous object were auctioned off among two bidders with flat demand for two units. We test whether expected demand reduction occurs in open and sealed-bid uniform-price auctions. Revenue equivalence is tested for these auctions as well as for the Ausubel, the Vickrey and the discriminatory sealed-bid auction. Furthermore, we compare the five mechanisms with respect to the efficient allocation of the units. We also provide some theoretical insights concerning the equilibria of uniform-price auctions with incomplete information.Multi–Unit Auctions, Demand Reduction, Experimental Economics.

The Impact of Resale on 2-Bidder First-Price Auctions where One Bidder's Value is Commonly Known

We consider 2-bidder first-price auctions where one bidder's value is commonly known. Such auctions induce an ineffcient allocation. We show that a resale opportunity, where the auction winner can make a take-it-or-leave-it offer to the loser, increases (reduces) the ineffciency of the market when the buyer with the commonly known value is weak (strong). Resale always reduces all bidders' payoffs and increases the initial seller's revenue.asymmetric first-price auctions, resale, effciency

Speculation in Standard Auctions with Resale

In standard auctions with symmetric, independent private value bidders resale creates a role for a speculator—a bidder who is commonly known to have no use value for the good on sale. For second-price and English auctions the efficient value-bidding equilibrium coexists with a continuum of inefficient equilibria in which the speculator wins the auction and makes positive profits. First-price and Dutch auctions have an essentially unique equilibrium, and whether or not the speculator wins the auction and distorts the final allocation depends on the number of bidders, the value distribution, and the discount factor. Speculators do not make profits in first-price or Dutch auctions

Comparing Open and Sealed Bid Auctions: Evidence from Timber Auctions

We study entry and bidding patterns in sealed bid and open auctions with heterogeneous bidders. Using data from U.S. Forest Service timber auctions, we document a set of systematic effects of auction format: sealed bid auctions attract more small bidders, shift the allocation towards these bidders, and can also generate higher revenue. We show that a private value auction model with endogenous participation can account for these qualitative effects of auction format. We estimate the model's parameters and show that it can explain the quantitative effects as well. Finally, we use the model to provide an assessment of bidder competitiveness, which has important consequences for auction choice.Open Auction, Sealed Bid Auction

Unique bid auctions: Equilibrium solutions and experimental evidence

Two types of auction were introduced on the Internet a few years ago and have rapidly been gaining widespread popularity. In both auctions, players compete for an exogenously determined prize by independently choosing an integer in some finite and common strategy space specified by the auctioneer. In the unique lowest (highest) bid auction, the winner of the prize is the player who submits the lowest (highest) bid, provided that it is unique. We construct the symmetric mixed-strategy equilibrium solutions to the two auctions, and then test them in a sequence of experiments that vary the number of bidders and size of the strategy space. Our results show that the aggregate bids, but only a minority of the individual bidders, are accounted for quite accurately by the equilibrium solutions.

Bidding Behavior in Multi-Unit Auctions - An Experimental Investigation and some Theoretical Insights

We present laboratory experiments of five different multi-unit auction mechanisms. Two units of a homogeneous object were auctioned off among two bidders with at demand for two units. We test whether expected demand reduction occurs in open and sealed-bid uniform-price auctions. Revenue equivalence is tested for these auctions as well as for the Ausubel, the Vickrey and the discriminatory sealed-bid auction. Furthermore, we compare the five mechanisms with respect to the efficient allocation of the units. We also provide some theoretical insights concerning the equilibria of uniform-price auctions with incomplete information.Multi-Unit Auctions; Demand Reduction; Experimental Economics