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