We study a social choice model with partially honest agents, and we show that strategy-proofness is a necessary and sufficient condition to achieve secure implementation. This result provides a behavioral foundation for the rectangularity property; and it offers as a by-product a revelation...

Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

In this paper, we give a sufficient condition for double implementation in Nash and M-Nash equilibria. Furthermore, we discuss the mechanism with transfers and prove that some important social choice rules are doubly implemented in Nash and M-Nash equilibria by the mechanism with transfers.

In this paper, we study the Nash implementation in an allocation problem with single-dipped preferences. We show that, with at least three agents, Maskin monotonicity is necessary and sufficient for implementation. We examine the implementability of various social choice correspondences (SCCs)...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

I consider whether the agentsʼ reluctance to make a large lie is helpful for the rule designer to construct a nonmanipulable rule. For this purpose, I study an axiom, called AM-proofness, saying that manipulation cannot occur through preferences adjacent to the sincere one. Through examples, I...