Overbidding in 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 use...

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

Overbidding in 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 use...

Overbidding in 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 use...

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

A budget-constrained buyer wants to purchase items from a short-listed set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer's problem is to select a subset of maximal quality. Money does not enter the buyer's objective function,...

We consider procurement of an innovation from heterogeneous sellers. Innovations are random but depend on unobservable effort and private information. We compare two procurement mechanisms where potential sellers first bid in an auction for admission to an innovation contest. After the contest,...

We present a new dynamic auction for procurement problems where payments are bounded by a hard budget constraint and money does not enter the procurer's objective function.

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer's problem is to select a subset of maximal quality. Money does not enter the buyer's objective function,...