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

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

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

We model leadership selection, competition, and decision making in teams with heterogeneous membership composition. We show that if the choice of leadership in a team is imprecise or noisy—which may arguably be the case if appointment decisions are made by non-expert administrators—then it...