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

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sönmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

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 investigate a model in which a monopoly supplier distributes two types of its product through a traditional retailer with a wholesale price contract and an online retailer with an agency contract. Because such an agency contract eliminates the double marginalization problem, the online...

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

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

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

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

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