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

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

Committee voting has mostly been investigated from the perspective of the standard Baron-Ferejohn model of bargaining over the division of a pie, in which bargaining ends as soon as the committee reaches an agreement. In standing committees, however, existing agreements can be amended. This...

We present a legislative bargaining model of the provision of a durable public good over an infinite horizion. In each period, there is a societal endowment which can either be invested in the public good or consumed. We characterize the optimal public policy, defined by the time path of...

We study a legislative bargaining game in which failure to agree in a given round may result in a breakdown of negotiations. In that case, each player receives an exogenous `disagreement value'. We characterize the set of stationary subgame perfect equilibria under all q-majority rules. Under...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

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

We study a legislative bargaining game in which failure to agree in a given round may result in a breakdown of negotiations. In that case, each player receives an exogenous ‘disagreement value'. We characterize the set of stationary subgame perfect equilibria under all q-majority rules. Under...