We present a new and simple mechanism for repeated public good environments. In the Conditional Contribution Mechanism (CCM), agents send two message of the form, "I am willing to contribute x units to the public good if in total y units are contributed." This mechanism offers agents risk-free...

We present a new and simple mechanism for repeated public good environments. In the Conditional Contribution Mechanism (CCM), agents send two message of the form, "I am willing to contribute x units to the public good if in total y units are contributed." This mechanism offers agents risk-free...

Weekly repo auctions are the European Central Bank's most important policy instrument. Provided that banks bid seriously, these auctions should determine the liquidity of the banking sector in an efficient and transparent way. However, under the fixed rate tender procedure used until June 2000,...

Weekly repo auctions are the European Central Bank's most important policy instrument. Provided that banks bid seriously, these auctions should reveal useful information about banks' liquidity needs and the stance of monetary policy. However 1 as we show in this paper, the applied auction rules...

In premium auctions, the highest losing bidder receives a reward from the seller. This paper studies the private value English premium auction (EPA) for different risk attitudes of bidders. We explicitly derive the symmetric equilibrium for bidders with CARA utilities and conduct an experimental...

In the variable supply auction considered here, the seller decides how many costumers with unit demand to serve after observing their bids. Bidders are uncertain about the seller's cost. We experimentally investigate whether a uniform or a discriminatory price auction is better for the seller in...

We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable in the sense that, even against a very clever opponent,...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...