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

We analyze two well-known matching mechanisms-the Gale-Shapley, and the Top Trading Cycles (TTC) mechanisms-in the experimental lab in three different informational settings, and study the role of information in individual decision making. Our results suggest that-in line with the theory-in the...

We analyze two well-known matching mechanisms - the Gale-Shapley, and the Top Trading Cycles (TTC) mechanisms - in the experimental lab in three different informational settings, and study the role of information in individual decision making. Our results suggest that - in line with the theory -...

We theoretically analyze the effects of a child allowance, an improvement in the efficiency of child rearing and a labor income tax on the fertility rate and per capita consumption. The effects on per capita consumption are opposite in the absence, and the presence, of unemployment. For example,...

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

We examine a monopolistic supplier's decision about a pure public good when he/she must negotiate with beneficiaries of the good. In our model, while the level of the public good is decided unilaterally by the supplier, the cost share of the public good is negotiated between the supplier and...

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

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

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

In the marriage problem (two-sided one-to-one matching problem), it is well-known that the weak core, the strong core and the set of stable matchings are all equivalent. This paper generalizes the above observation considering the G-weak core and the G-strong core. These are core concepts in...