We investigate the implementation of social choice functions (SCFs) from an epistemological perspective. We consider the possibility that in higher-order beliefs there exists an honest agent who is motivated by intrinsic preference for honesty as well as material interest. We assume weak...

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

We consider the possibility that in a society where innately prosocial and adversarial agents exist albeit in the minority, the majority of agents behave honestly from two distinct perspectives. First, we consider a socioeconomic perspective in which the majority are influenced by their partners...

This paper considers an implementation problem with bounded rationality of the agents. Bounded rationality presented here means that the agent might choose the agent's best response which is different from the agent's dominant strategy. To describe such a behavior, this paper introduces a new...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

This paper introduces a mechanism design approach that allows dealing with the multiple equilibrium problem, using mechanisms that are robust to bounded rationality. This approach is a tool for constructing supermodular mechanisms, i.e. mechanisms that induce games with strategic...

A mechanism is unsafe if a small number of agents deviating unexpectedly can make the mechanism deliver an outcome regarded as bad by a large number of other agents. Under Nash behavior, the direct approach of designing mechanisms with only safe Nash equilibria is impossible in many...

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

The implementation problem is the problem of designing a mechanism (game form) such that the equilibrium outcomes satisfy a criterion of social optimality embodied in a social choice rule. If a mechanism has the property that, in each possible state of the world, the set of equilibrium outcomes...