An agent is said to be partially honest if he or she weakly prefers an outcome at a strategy profile with his truthful strategy than an outcome at a strategy profile with his false strategy, then this player must prefer strictly the \true" strategy profille to the \false" strategy profile. In...

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 goal of this paper is to propose a comparison of four multi-winner voting rules, k-Plurality, k-Negative Plurality, k-Borda, and Bloc, which can be considered as generalisations of well-known single-winner scoring rules. The first comparison is based on the Condorcet committee efficiency...

Abstract: In this paper we explore the problem of Nash implementation providing new sufficient conditions called I-monotonicity and I-weak no-veto power. Firstly, we show that these conditions together with unanimity are sufficient for the implementation of social choice correspondences (SCCs)...

In this paper we explore the problem of Nash implementation providing two new properties called I-monotonicity and I-weak no-veto power. These properties form together with unanimity a new sufficient condition for a social choice correspondence to be implementable in Nash equilibria with at...