Bidding in first-price auctions crucially depends on the beliefs of the bidders about their competitors' willingness to pay. We analyze bidding behavior in a first-price auction in which the knowledge of the bidders about the distribution of their competitors' valuations is restricted to the...

This paper explores the sale of an object to an ambiguity averse buyer. We show that the seller can increase his profit by using an ambiguous mechanism. That is, the seller can benefit from hiding certain features of the mechanism that he has committed to from the agent. We then characterize the...

We study the bilateral trade problem put forward by Myerson and Satterthwaite (1983) under the assumption that agents are loss-averse. We use the model developed by Koszegi and Rabin (2006, 2007) to find optimal mechanisms for the minimal subsidy, revenue maximization and welfare maximization...

We study the bilateral trade problem put forward by Myerson and Satterthwaite (1983) under the assumption that agents are loss-averse, using the model developed by Koszegi and Rabin (2006, 2007). We show that the endowment effect increases the sellers information rent, and that the attachment...

The endowment and attachment effect are empirically well-documented in bilateral trade situations. Yet, the theoretical literature has so far failed to formally identify these effects. We ftll this gap by introducing expectations-based loss aversion, which can explain both effects, into the...

We propose a model of instrumental belief choice under loss aversion. When new information arrives, an agent is prompted to abandon her prior. However, potential posteriors may induce her to take actions that generate a lower utility in some states than actions induced by her prior. These losses...

Evidence suggests that participants in direct student-proposing deferred-acceptance mechanisms (DA) play dominated strategies. To explain the data, we introduce expectation-based loss aversion into a school-choice setting and characterize choice-acclimating personal equilibria in DA. We find...

Deferred Acceptance (DA), a widely implemented algorithm, is meant to improve allocations: under classical preferences, it induces preference-concordant rankings. However, recent evidence shows that—in both real, large-stakes applications and experiments—participants frequently play...

Deferred Acceptance (DA), a widely implemented algorithm, is meant to improve allocations: under classical preferences, it induces preference-concordant rankings. However, recent evidence shows that--in both real, large-stakes applications and experiments--participants frequently play seemingly...