We characterize the revenue-maximizing mechanism for time separable allocation problems in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...

A single seller faces a sequence of buyers with unit demand. The buyers are forward-looking and long-lived. Each buyer has private information about his arrival time and valuation where the latter evolves according to a geometric Brownian motion. Any incentive-compatible mechanism has to induce...

We derive the revenue maximizing allocation of m units among n symmetric agents who have unit demand, and who take costly actions that influence their values before participating in the mechanism. The allocation problem with costly actions can be represented by a reduced form model where agents...