Different evaluators typically disagree how to rank different candidates since theycare more or less for the various qualities of the candidates. It is assumed that allevaluators submit vector bids assigning a monetary bid for each possible rank order.The rules must specify for all possible...

Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on players's preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

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

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

In this paper, we reexamine Eliaz's results (2002) of fault tolerant implementation on one hand and we extend theorems 1 and 2 of Doghmi and Ziad (2008 a) to bounded rationality environments, on the other. We identify weak versions of the k-no veto power condition, in conjunction with unanimity...

We consider the allotment problems of homogeneous indivisible objects among agents with single-peaked and risk-averse von Neumann-Morgenstern expected utility functions. We establish that the rule satisfies coalitional strategy-proofness, same-sideness, and strong symmetry if and only if it is...

We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the...

The provision of public goods often relies on voluntary contributions and cooperation. While most of the experimental literature focuses on individual contributions, many real-world problems involve the formation of institutions among subgroups (coalitions) of players. International agreements...

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