We analyze the dynamic assignment of objects to agents organized in a constant size waiting list. Applications include the assignment of social housing and organs for transplants. We analyze the optimal design of probabilistic queuing disciplines, punishment schemes, and information release. With private values, all agents prefer first-come first-served to the lottery, but waste is lower at the lottery. With common values, all agents prefer first-come first-served to any other mechanism, and waste is minimized at the lottery. Punishment schemes accelerate turnover in the queue and information release increases the value of agents at the top of the waiting list. (JEL C78, D44, D82)

The work examines strategy-proof social choice functions which select a level or the location of a public good when its consumption is not compulsory. We assume that agents have single-peaked preferences on the consumption of the public good as well as a reservation utility. Agents opt out of the good whenever they get a utility smaller than their reservation utility. We characterize strategy-proof and efficient social choice functions as well as the ones which are anonymous and group strategy-proof. Finally, we observe that for given preferences a Condorcet winner may not exist. Copyright Springer-Verlag 2004

Topics : Economics Theory, Economics generalInternational audienceWe analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent retires, leaving his object to be reassigned. We define independent assignment rules (where the assignment of an object to an agent is independent of the way other objects are allocated to other agents), efficient assignment rules (where there does not exist another assignment rule with larger expected surplus), and fair assignment rules (where agents experiencing the same circumstances have identical histories in the long run). When agents are homogenous, we characterize efficient, independent and fair rules as generalizations of the seniority rule. When agents draw their types at random, we prove that independence and efficiency are incompatible, and that efficient and fair rules only exist when there are two types of agents. We characterize two simple rules (type-rank and type-seniority) which satisfy both efficiency and fairness criteria in dichotomous settings

No abstract

No abstract