Recently, some literature on incomplete contracts studies the cases where renegotiations take place inefficiently. We extend the incomplete contract model in Hart (2009) by assuming that one party chooses an action which affects renegotiation costs. In our model, renegotiation costs are...

We study optimal auctions with expectation-based loss-averse bidders. We first consider when bidders are ex-ante identical. Although symmetric designs are optimal for bidders with expected-utility preferences, if the degree of loss aversion is sufficiently large relative to the variation in...

We consider relational contracts for teams in which the agents monitor each other. We demonstrate that providing rents to the agents strengthens peer sanction endowed within the agents' ongoing relationship, which may have a negative effect to induce unproductive collusion as well as a positive...

A dynamic mechanism design problem is considered. We suppose dynamic population and identical perishable goods, such as time slots of a central facility and hotel rooms. We consider a situation where each agent needs to keep an object for more than one period to make profits. The seller makes...

This paper considers a class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. In every ascending auction, the Vickrey-target strategy, i.e., bidding up to the Vickrey price based on provisional valuations,...

This paper considers a general package auction problem and a class of payment rules we refer to as standard. In a “standard” pricing rule, each winner pays at least his “minimum required value” to win. The minimum required value coincides with the payment in the Vickrey auction, and...

This paper characterizes the perfect Bayesian equilibrium in an ascending price package auction. Bidders play history-dependent strategies in an ascending auction, and we show that it leads to serious underbidding. We suppose that there are 2 objects and 3 bidders: 2 local and 1 global bidders....

This paper considers dynamic communication mechanisms in a quasi-linear single-value environment. The mechanism designer gradually identifies agents' valuations by iteratively offering prices to agents at different stages. Agents pay the maximum price they accepted if their desirable decision is...

This study considers a mechanism design problem in which service slots are allocated over time to buyers arriving at different periods. Some buyers can accept delayed service, whereas others cannot. Buyers have a multidimensional type representing their valuation and patience level. The seller...

This study compares standard auctions when bidders are financially constrained and valuation is endogenously determined by ex post investment. Bidders have a convex cost function because of financial constraints or borrowing costs. When the valuation is linear in investment, the revenue and...