We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

Collusive agreements are often observed in procurement auctions. They are probablymore easily achieved when competitors’ costs are easily estimated. If, however, the individualcosts of bidders are private information, effective ring formation is difficult to realize.We compare experimentally...

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...

This article reports the results of a first-price sealed-bid auction experiment, which has been designed to test the Nash equilibrium predictions of individual bidding behavior. Subjects faced in 100 auctions always the same resale value and competed with computerized bids. Three treatments were...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. Inparticular,...

When a partnership comes to an end partners have to determine the terms of the dissolution. A well known way to do so is by enforcing a buy/sell option. Under its rules one partner has to offer a price for the partnership and the other agent can choose whether she wants to sell her share or buy...

We use experiments to compare dynamic and static wars of attrition (i.e. second-price all-pay auctions) and first-price all-pay auctions. Many other studies find overbidding in first-price all-pay auctions. We can replicate this property. In wars of attrition, however, we find systematic...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. In particular,...

We study an in.nitely-repeated .rst-price auction with common values. Initially, bid-ders receive independent private signals about the objects. value, which itself does not change over time. Learning occurs only through observation of the bids. Under one-sided incomplete information, this...

Two auction mechanisms are studied in which players compete with one another for an exogenously determined prize by independently submitting integer bids in some discrete and commonly known strategy space specified by the auctioneer. In the unique lowest (highest) bid auction game, the winner of...