Similar to Levati and Neugebauer (2001), a clock is used by which participants can vary their individual contributions for voluntarily providing a public good. As time goes by, participants either in(de)crease their contribution gradually or keep it constant. Groups of two poorly and two richly...

We analyze the doping behavior of heterogeneous athletes in an environment of private information. In a n-player strategic game, modeled as an all-pay auction, each athlete has private information about his actual physical ability and choses the amount of performance-enhancing drugs. The use of...

We derive a necessary and sufficient condition for the existence of equilibria with only two active players in the all-pay auction with complete information and identity-dependent externalities. This condition shows that the generic equilibrium of the standard all-pay auction is robust to the...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

The fixed rate tender is one of the main operational formats used by central banks in the implementation of their monetary policies. While academic research has largely dismissed the procedure for its tendency to encourage overbidding, central banks such as the ECB and the Bank of England have...

Potential bidders respond to a seller's choice of auction mechanism for a common-value or affiliated-values asset by endogenous decisions whether to incur an information-acquisition cost (and observe a private estimate), or forgo competing. Privately informed participants decide whether to incur...

A minimal diversity game is an n player strategic form game in which each player has pure strategies at his disposal. The payoff to each player is always 1, unless all players select the same pure strategy, in which case all players receive zero payoff. Such a game has a unique isolated...

Overbidding in sealed-bid second-price auctions (SPAs) has been shown to be persistent and associated with cognitive ability. We study experimentally to what extent cross-game learning can reduce overbidding in SPAs, taking into account cognitive skills. Employing an order-balanced design, we...

An uncovered bargaining solution is a bargaining solution for which there exists a complete and strict relation (tournament) such that, for each feasible set, the bargaining solution set coincides with the uncovered set of the tournament. We provide a characterization of a class of uncovered...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...