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

Arne Ryde Memorial Lectures Series List -- Contents -- About the Arne Ryde Foundation -- Acknowledgments -- 1 Introduction -- 2 The Sequential Assignment of Heterogeneous Objects -- 3 Dynamic Revenue Maximization with Heterogeneous Objects -- 4 The Stochastic and Dynamic Knapsack Model -- 5...

We study a multi-dimensional collective decision under incomplete information. Agents have Euclidean preferences and vote by simple majority on each issue (dimension), yielding the coordinate-wise median. Judicious rotations of the orthogonal axes -- the issues that are voted upon -- lead to...

We study the revenue maximizing allocation of m units among n symmetric agents with unit demand that have convex preferences over the probability of receiving an object. We show that such preferences are naturally induced by a game where the agents take costly actions that affect their values...

A designer allocates several indivisible objects to a stream of randomly arriving agents. The long-lived agents are privately informed about their value for an object, and about their arrival time to the market. The designer learns about future arrivals from past arrivals, while agents...

We compare sequential, binary voting schemes conducted by privately informed agents with interdependent preferences and three alternatives a compromise alternative in addition to two "extreme" alternatives on the left and on the right. The Anglo-Saxon amendment procedure always selects the...