An important characteristic of any offer is the deadline at which it expires. We consider an ultimatum deadline game in which the proposer's decision variable is the offer deadline, while the responder faces a standard finite-horizon search problem. We show that the responder's strategy is...

Risk aversion is one of the most commonly cited properties of human decision making (e.g., Kahneman & Tversky, 1979). This finding is at odds with traditional expected value theory, but not with more recent theories of rational choice (e.g., von Neumann & Morgenstern, 1944). Since Bernoulli?s...

We consider a class of sequential observation and selection decision problems in which applicants are interviewed one at a time, decision makers only learn the applicant's quality relative to the applicants that have been interviewed and rejected, only a single applicant is selected, and payoffs...

We study a problem of selling a fixed number of goods over a finite and known horizon. After presenting a procedure for computing optimal decision policies and some numerical results of a simple heuristic policy for the problem, we describe results from three experiments involving financially...

Before and during the 2010 Soccer World Cup, participants made probabilistic forecasts of the outcomes of the tournament. We examine the relationship between their depression levels and their performance at this forecasting task. Across two different waves of predictions and with multiple...

Theoretical models of multi-unit, uniform-price auctions assume that the price is given by the highest losing bid. In practice, however, the price is usually given by the lowest winning bid. We derive the equilibrium bidding function of the lowest-winning-bid auction when there are k objects for...

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k1 objects are sold in the first round and k2 in the second round, with and without revelation of the first-round winning bids. We demonstrate that...

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k1 objects are sold in the first round and k2 in the second round, with and without revelation of the first-round winning bids. We demonstrate that...

Information aggregation, a key concern for uniform-price, common-value auctions with many bidders, has been characterized in models where bidders know exactly how many rivals they face. A model allowing for uncertainty over the number of bidders is essential for capturing a critical condition...