Strategy-proofness, requiring that truth-telling be a dominant strategy, is a standard concept in social choice theory. However, this concept has serious drawbacks. In particular, many strategy-proof mechanisms have multiple Nash equilibria, some of which produce the wrong outcome. A possible...

We consider the problem where agents bargain over their shares of a perfectly divisible commodity. The aim of this paper is to identify the class of bargaining solutions induced by dominant strategy implementable allocation rules. To this end, we characterize the class of dominant strategy...

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

Gale and Shapley (1962) proposed that there is a similar game to the marriage problem called "the roommate problem". And, they showed that unlike the marriage problem, the roommate problem may have unstable solutions. In other words, the stability theorem fails for the roommate problem. In this...

We show that there is no consistent Pareto improvement over any stable mechanism. To overcome this impossibility, we introduce the following weak consistency requirement: Whenever a set of students, each of whom is assigned to a school that is under-demanded at the student-optimal stable...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sonmez (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,...

We investigate implementation of social choice functions with asymmetric information concerning the state from epistemological perspectives. While each agent is either selfish or honest, they do not expect other participants to be honest. Nevertheless, an honest agent may exist, not among the...

This paper considers the problem of allocating an amount of a perfectly divisible resource among agents. We are interested in rules eliminating the possibility that an agent can compensate another to misrepresent her preferences, making both agents strictly better off. Such rules are said to be...

We show that the characterization result of the weak core correspondence in simple games in Takamiya et al. (2018) still holds true even when the set of alternatives contains uncountably infinite elements

In this paper we provide sufficient conditions for a social choice rule to be implementable in strong Nash equilibrium in the presence of partially honest agents, that is, agents who break ties in favor of a truthful message when they face indifference between outcomes. In this way, we achieve a...