Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to asses the chances of being admitted at a particular school, and hence may...

We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...

This experimental study investigates two bargaining games with twosided incomplete information between a seller and a buyer. In the first game with no outside options many subjects do not use the incomplete information to their advantage as predicted. We find that a model with adjusting priors...

Optimal team composition has been the focus of exhaustive analysis, academic and otherwise. Yet, much of this analysis has ignored possible dynamic effects: e.g., anticipating that team formation is based on prior performance will affect prior performance. We test this hypothesis in a lab...

We study experimentally a two-stage compensation mechanism for promoting cooperation in prisoner's dilemma games. In stage 1, players simultaneously choose binding non-negative amounts to pay their counterparts for cooperating in a given prisoner's dilemma game, and then play the prisoner's...

This paper considers the object allocation problem introduced by Shapley and Scarf (1974). We study secure implementation (Saijo, Sjöström, and Yamato, 2007), that is, double implementation in dominant strategy and Nash equilibria. We prove that (i) an individually rational solution is...

We study the problem of allocating a bundle of perfectly divisible private goods from an axiomatic point of view, in situations where compensations can be made through monetary transfers. The key property we impose on the allocation rule requires that no agent should be able to gain by...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sj¨ostr¨om, and Yamato, 2006; Saijo, Sj¨ostr¨om, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...

We consider the problems of fairly allocating indivisible objects and money. The objective of the present study is to examine strategic manipulation under envy-free solutions. We show that each individual obtains the welfare level of his "optimal" envy-free allocation by maximally manipulating...