We analyze the dynamics of takeover contests where hostile raiders compete against white knights involved by a lead blockholder of the target firm (the incumbent). We assume that the incumbent has the power to bargain with the potential bidders to set a minimum takeover price. We characterize...

In a laboratory experiment, we compare two auction mechanisms that determine the sequence of service to queued customers. In the server-initiated auction, the server, when idle, sells the right to be served next to the highest bidding customer in the queue and distributes the proceeds among the...

According to basic models of sequential private value auctions of identical objects, consecutive prices are on average constant or rising. In empirical studies, prices are often found to decline. Several explanations have been put forward for this declining price anomaly. In this paper we...

The objects for sale in most auctions possess both private and common value elements. This salient feature has not yet been incorporated into a strategic analysis of equilibrium bidding behaviour. This paper reports such an analysis for a stylised model in which bidders receive a private value...

We study fairness and reciprocity in a Hawk-Dove game. This alllows us to testvarious models in one framework. We observe a large extent of selfish and rationalbehavior. Our results are inconsistent with leading models in this field.

This paper provides a structural empirical analysis of Dutch auctions of houseplants at the flower auction in Aalsmeer, the Netherlands. The data set is unique for Dutch auctions in the sense that it includes observations of all losing bids in an interval adjacent to the winning bid. The size of...

Multi-unit ascending auctions allow for equilibria in which bidders strategically reduce their demand and split the market at low prices. At the same time, they allow for preemptive bidding by incumbent bidders in a coordinated attempt to exclude entrants from the market. We consider an...

A situation in which a finite set of players can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility. A solution for TU-games assigns to every TU-game a distribution of the payoffs that can be earned over the individual players. Two well-known...

We study auctions in which the number of potential bidders is large, such as in Internet auctions. With numerous bidders, the expected revenue and the optimal bid function in a first price auction result in complicated expressions, except for a few simple distribution function for the bidders'...

This paper develops one possible argument why auctioning licenses to op-erate in an aftermarket may lead to higher prices in the aftermarket comparedto a more random allocation mechanism. Key ingredients in the argumentare differences in firms' risk attitudes and the fact that future market...