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

This study considers revenue-optimal auction design for two ordered substitutes, such as positions or priorities. Bidders have a two-dimensional type about a valuation for the top position and a discount rate of the second position for the top. An auction mechanism is dominant-strategy incentive...

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

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