Partially-honest Nash implementation: a full characterization

A partially-honest individual is a person who follows the maxim, “Do not lie if you do not have to”, to serve your material interest. By assuming that the mechanism designer knows that there is at least one partially-honest individual in a society of n≥3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ n\ge 3$$\end{document} individuals, a social choice rule that can be Nash implemented is termed partially-honestly Nash implementable. The paper offers a complete characterization of the (unanimous) social choice rules that are partially-honestly Nash implementable. When all individuals are partially-honest, then any (unanimous) rule is partially-honestly Nash implementable. An account of the welfare implications of partially-honest Nash implementation is provided in a variety of environments.


Introduction
The implementation problem is the problem of designing a mechanism or game form with the property that, for each state of the world, the equilibrium outcomes of the mechanism played in that state coincide with the recommendations that a given social choice rule (SCR) F would prescribe for that state. If that mechanism design exercise can be accomplished, the SCR is said to be implementable. The fundamental paper on implementation in Nash equilibrium is thanks to Maskin (1999;circulated since 1977), who proves that any SCR that can be Nash implemented satisfies a remarkably strong invariance condition, now widely referred to as Maskin monotonicity. Moreover, he shows that when the mechanism designer faces n ≥ 3 individuals, a SCR is Nash implementable if it is Maskin monotonic and satisfies the condition of no veto-power, subsequently, Maskin's theorem. 1 Since the introduction of Maskin's theorem, economists have been interested in understanding how to circumvent the limitations imposed by Maskin monotonicity by exploring the possibilities offered by approximate (as opposed to exact) implementation (Matsushima 1988;Abreu and Sen 1991), as well as by implementation in refinements of Nash equilibrium (Moore and Repullo 1988;Abreu and Sen 1990;Palfrey and Srivastava 1991;Jackson 1992;Vartiainen 2007a) and by repeated implementation (Kalai and Ledyard 1998; Lee and Sabourian 2011;Mezzetti and Renou 2012). One additional way around those limitations is offered by implementation with partially-honest individuals.
A partially-honest individual is an individual who deceives the mechanism designer when the truth poses some obstacle to her material well-being. Thus, she does not deceive when the truth is equally efficacious. Simply put, a partially-honest individual is an individual who follows the maxim, "Do not lie if you do not have to", to serve your material interest.
In a general environment, a seminal paper on Nash implementation problems involving partially-honest individuals is Dutta and Sen (2012), which shows that for implementation problems involving n ≥ 3 individuals and in which there is at least one partially-honest individual, the Nash implementability is assured by no veto-power. No veto-power means that if an outcome is at the top of all but one agent's ranking, then it must be selected by the SCR. Similar positive results are uncovered in other environments by Matsushima (2008a, b), Kartik and Tercieux (2012), Kartik et al. (2014), Saporiti (2014), Ortner (2015) and Mukherjee et al. (2017). Thus, there are far fewer limitations for Nash implementation when there are partially-honest individuals. 2 1 Moore and Repullo (1990), Dutta and Sen (1991), Sjöström (1991) and Lombardi and Yoshihara (2013) refined Maskin's theorem by providing necessary and sufficient conditions for a SCR to be implementable in (pure strategies) Nash equilibrium. For two recent excellent surveys on the subject of implementation, see Jackson (2001) and Maskin and Sjöström (2002). For a concise and elegant collection of seminal results on the subject of mechanism design, the reader should consult Dasgupta et al. (1979). 2 A pioneering work on the impact of decency constraints on Nash implementation problems is Corchón and Herrero (2004). These authors propose restrictions on sets of strategies available to agents that depend on the state of the world. They refer to these strategies as decent strategies and study Nash implementation problems in them. For a particular formulation of decent strategies, they are also able to circumvent the limitations imposed by Maskin monotonicity. A natural question, then, is: where do the exact boundaries of those limitations lie? This question is relevant to test whether a SCR is Nash implementable or not in a society with partially-honest individuals. Indeed, though the no veto-power condition is trivially satisfied in economic environments with three or more non-satiated agents, it is not always an innocuous condition in other environments (as we discuss below). This means that Dutta and Sen's (2012) result does not offer any guidance about the Nash implementability of SCRs violating the no veto-power condition. The paper offers this guidance by providing a complete characterization for Nash implementation with partially-honest individuals when there are three or more individuals. Thus, it provides the counterpart to Moore and Repullo's (1990) conditions-which are summarized as Condition μ by Moore and Repullo (1990)-for a many-person setting with partiallyhonest individuals.
The necessary and sufficient conditions are derived by using the approach developed by Moore and Repullo (1990). They are derived under the following informational requirement: Although the mechanism designer knows that there are partially-honest agents, he knows neither their identity nor how many agents are partially-honest. In Sect. 3, we present the first part of our conditions, which is named Condition μ * (ii). To understand its content, suppose that F can be Nash implemented with partially-honest individuals. Suppose that x belongs to F(θ ). Then, there exists an equilibrium of the implementing mechanism that induces x under the state θ . Condition μ * (ii) identifies situations when a deviation from the equilibrium under θ is not followed by further deviations when the state changes from θ to θ . Let us suppose that the deviation of agent i from the equilibrium under θ results into an outcome y. Moreover, suppose that we know that y is θ -maximal for agent i over the range of outcomes that i can generate by deviating from the equilibrium under θ , and that y is θ -maximal in the range of the implementing mechanism for every other individual. Let us distinguish two situations. (a) If we know that agent i has deviated to a strategy that is truthful at the new state θ and he is the unique partially-honest agent in society, then y must be an equilibrium under θ . (b) If we know that θ = θ , that agent i is not a partially-honest individual and that every partially-honest individual is playing a truthful strategy under the new state θ , then y must be an equilibrium under θ . Note that since Condition μ * (ii) applies to situations in which not all agents are partially-honest, this condition does not have any bite when all agents are partially-honest and the mechanism designer knows this. A more detailed discussion about Condition μ * (ii) is provided in Sect. 3.
Condition μ * (ii) is reasonably weak (albeit somewhat complex). From Dutta and Sen's (2012) work, we know that no veto-power is sufficient for Nash implementation with partially-honest individuals. However, our condition is much weaker than no vetopower. This is important because no veto-power is not always a weak requirement, such as in bargaining environments and in marriage problems. Moreover, Condition μ * (ii) does not include any Maskin monotonicity-type conditions. Remarkably, we have found that when there are three or more individuals, and when the admissible domain of SCRs is restricted to that of unanimous ones, then Condition μ * (ii) is not only necessary but is also sufficient for any unanimous SCR to be Nash implemented (Theorem 1). A SCR is said to be unanimous if it satisfies the following property: if every agent prefers x to any other outcome in state θ , then x ∈ F (θ ). For the sufficiency part, a constructive proof is provided. Indeed, we construct a mechanism in which each participant chooses the information about a state as part of her strategy choice and in which a participant's play is honest if she plays a strategy choice which is veracious in its state announcement component. 3 Theorem 2 shows that every unanimous SCR is implementable when all agents are partially-honest and the mechanism designer knows this.
By means of Condition μ * (ii), we can easily check what SCR is implementable within the domain of unanimous SCRs. For instance, in the coalitional game environment, we show that the core solution is not Nash implementable with partially-honest individuals when the mechanism designer knows the coalitional function of the games, who, however, does not know the prevailing state. As we already noted, we also show that every unanimous SCR is Nash implementable in a society in which all individuals are partially-honest and the designer knows it. This means that the core solution is Nash implementable when all individuals are partially-honest. These examples clarify that the common assumption in the present literature on implementation problems with partial honesty that the designer knows that all individuals are partially-honest is not innocuous.
Finally, we also analyze interesting and well-known SCRs in bargaining environments as well as in marriage problems. Indeed, we show that the Nash bargaining solution and the man-optimal-stable solution are partially-honestly Nash implementable. Note that each of these SCRs is unanimous. However, they both violate the no veto-power condition.
The remainder of this paper is divided into 4 sections. Section 2 sets out the theoretical framework and outlines the basic model. Section 3 completely characterizes the class of Nash implementable SCRs satisfying the unanimity condition and assesses its implications in a variety of environments. Section 4 offers a brief discussion of the second part of the necessary and sufficient conditions for Nash implementation with partially-honest individuals in connection with the implementability of the egalitarian bargaining solution. 4 Section 5 concludes. Appendix includes proofs not in the main body.

Basic framework
We consider a finite set of individuals indexed by i ∈ N = {1, . . . , n}, which we will refer to as a society. The set of outcomes available to individuals is X . The information held by the individuals is summarized in the concept of a state, which is a complete description of the variable characterizing the world. Write for the domain of possible states, with θ as a typical state. In the usual fashion, individual i's preferences in state θ are given by a complete and transitive binary relation, subsequently an ordering, R i (θ ) over the set X . The corresponding strict and indifference relations are denoted by P i (θ ) and I i (θ ), respectively. The statement x R i (θ ) y means that individual i judges x to be at least as good as y. The statement x P i (θ ) y means that individual i judges x better than y. Finally, the statement x I i (θ ) y means that individual i judges x and y as equally good, that is, she is indifferent between them.
We assume that the mechanism designer does not know the true state, that there is complete information among the individuals in N and that the mechanism designer knows the preference domain consistent with the domain . We shall sometimes identify states with preference profiles.
The goal of the mechanism designer is to implement a SCR F, which is a correspondence F : X such that F (θ ) is non-empty for every θ ∈ . We shall refer to x ∈ F (θ ) as an F-optimal outcome at θ . The image or range of the SCR F is the Given that individuals will have to be given the necessary incentives to reveal the state truthfully, the mechanism designer delegates the choice to individuals according to a mechanism ≡ i∈N M i , g , where M i is the strategy space of individual i and g : M → X , the outcome function, assigns to every strategy profile m ∈ M ≡ i∈N M i a unique outcome in X . The strategy profile m −i is obtained from m by omitting the ith component, that is,

Intrinsic preferences for honesty
An individual who has an intrinsic preference for truth-telling can be thought of as an individual who is torn by a fundamental conflict between her deeply and ingrained propensity to respond to material incentives and the desire to think of herself as an honest person. In this paper, the theoretical construct of the balancing act between those contradictory desires is based on two ideas.
First, the pair ( , θ ) acts as a " context" for individuals' conflicts. The reason for this is that an individual who has an intrinsic preference for honesty can categorize her strategy choices as truthful or untruthful relative to the state θ and the mechanism designed by the mechanism designer to govern the communication with individuals. That categorization can be captured by the following notion of truth-telling correspondence: Definition 1 For each and each individual i ∈ N , individual i's truth-telling correspondence is a (non-empty) correspondence T i : M i such that, for each θ ∈ , T i (θ ) ⊆ M i . Strategy choices in T i (θ ) will be referred to as truthful strategy choices for θ . What messages can be regarded as truthful ones depends on the message space M i specified by . For instance, if is a canonical mechanism where M i = × X × N for each individual i, then agent i's truth-telling corresponding T can be defined by T i (θ ) = {θ } × X × N for each state θ ∈ . 5 This means that a message is truthful if it is truthful in its state announcement component. Indeed, Dutta and Sen (2012) used this type of truth-telling correspondence in their characterization result. It is important to emphasize that Condition μ * (ii) is a necessary condition for implementation with partially-honest individuals for every notion of truth-telling. Like Dutta and Sen (2012), our sufficiency result is derived by assuming that T i (θ ) = {θ } × X × N for each state θ ∈ and each individual i ∈ N .
Second, in modeling intrinsic preferences for honesty, we endorse the notion of partially-honest individuals introduced by Dutta and Sen (2012). First, a partiallyhonest individual is an individual who responds primarily to material incentives. Second, she strictly prefers to tell the truth whenever lying has no effect on her material well-being. That behavioral choice of a partially-honest individual can be modeled by extending an individual's ordering over X to an ordering over the strategy space M because individual's preference between being truthful and being untruthful is contingent upon announcements made by other individuals as well as the outcome(s) obtained from them. By following standard conventions of orderings, write ,θ i for individual i's ordering over M in state θ whenever she is confronted with the mechanism . Formally, our notion of a partially-honest individual is as follows: An intrinsic preference for honesty of individual i is captured by the first part of the above definition, in that, for a given mechanism and state θ , individual i strictly prefers the strategy profile (m i , m −i ) to m i , m −i provided that the outcome g (m i , m −i ) is at least as good as g m i , m −i according to her ordering R i (θ ) and that m i is truthful for θ and m i is not truthful for θ .
If individual i is not partially-honest, this individual cares for her material wellbeing associated with outcomes of the mechanism and nothing else. Then, individual i's ordering over M is just the transposition into space M of individual i's relative ranking of outcomes: m

Implementation problems
In formalizing the mechanism designer's problem with partially-honest individuals, we first introduce an informational assumption and discuss its implications for our analysis. It is: Assumption 1 There exists at least one partially-honest individual in the society N .
Thus, in our setting, the mechanism designer does not know the true state and, moreover, he knows neither the identity (or identities) nor the number of the partiallyhonest individual(s). Indeed, the mechanism designer cannot exclude any member(s) of society from being partially-honest purely on the basis of Assumption 1. Therefore, the following considerations are in order from the viewpoint of the mechanism designer. An environment is described by two parameters, (θ, H ): a state θ and a conceivable set of partially-honest individuals H . We denote by H a typical conceivable set of partially-honest individuals in N , with h as a typical element, and by H the class of conceivable sets of partially-honest individuals.
A mechanism and an environment (θ, H ) induce a strategic game , ,θ,H , where: ,θ,H ≡ A (pure strategy) Nash equilibrium of the strategic game , ,θ,H is a strategy profile m such that for all i ∈ N , it holds that Write N E , ,θ H for the set of Nash equilibrium strategies of the strategic game , ,θ,H and N A , ,θ,H for its corresponding set of Nash equilibrium outcomes.
The following definition is to formulate the designer's Nash implementation problem involving partially-honest individuals.
Definition 3 Let Assumption 1 hold. A mechanism partially-honestly Nash implements the SCR F : X provided that for all θ ∈ there exists a truth-telling correspondence T i (θ ) as formulated in Definition 1 for every i ∈ N and, moreover, it holds that If such a mechanism exists, F is said to be partially-honestly Nash implementable.
The objective of the mechanism designer is thus to design a mechanism whose Nash equilibrium outcomes coincide with F (θ ) for each state θ as well as each set H . Note that there is no distinction between the above formulation and the standard Nash implementation problem as long as Assumption 1 is discarded.

The characterization theorem for unanimous SCRs
In this section, we provide a full characterization of the class of unanimous SCRs that are partially-honestly Nash implementable: Definition 4 The SCR F : X satisfies unanimity provided that for all θ ∈ and all x ∈ X if x R i (θ ) y for all i ∈ N and all y ∈ X , then x ∈ F (θ ). A SCR that satisfies this property is said to be a unanimous SCR.
In other words, it states that if an outcome is at the top of the preferences of all individuals, then it should be selected by the SCR. Unanimity is a property satisfied, for example, by the Pareto rule and, in the market contexts, by the rule which selects all core allocations.
We introduce below Condition μ * (ii), which is necessary and sufficient for partiallyhonest implementation of unanimous SCRs in many-individual settings. Before doing it, let us introduce Condition μ for the sake of completeness and clarity. Moore and Repullo (1990) show that, for a society with more than two agents, Condition μ is the necessary and sufficient condition for any SCR to be Nash implementable. Let us formalize it as follows. Given a state θ , an individual i, a set of outcomes A ⊆ X and an outcome x ∈ X , the indifference set of finally, for all θ ∈ , the following Conditions (i)-(iii) are satisfied: Condition μ(i) is equivalent to Maskin monotonicity, while Conditions μ(ii) and μ(iii) are weaker versions of no veto-power. Note that Conditions μ(iii) is satisfied by any unanimous SCR-to see it, let consider Y = X . Also, note that Condition μ requires the existence of the set Y as well as the existence of the set C i (θ, x) for each triplet (i, x, θ) with x ∈ F (θ ).
Let us formalize Condition μ * (ii) as follows.
Definition 5 The SCR F : X satisfies Condition μ * (ii) if there exists Y ⊆ X such that F ( ) ⊆ Y and such that the following statements hold: For every (i, θ, x (θ, x), such that for every pair θ , H ∈ × H we have: (1) (a) There exists a non-empty set Like Condition μ, Condition μ * (ii) requires the existence of Y and (C i (θ, x)) i∈N as well. Their interpretation is offered by Moore and Repullo (1990). The set Y represents the range of the mechanism by which a given SCR F is Nash implementable. The set C i (θ, x) represents individual i's attainable set when the equilibrium outcome x ∈ F (θ ) is selected by the outcome function. In contrast to Condition μ, part (1)(a) of Condition μ * (ii) also requires the existence of a set S i θ ; Let us present our condition from the viewpoint of necessity. To this end, suppose that F is partially-honestly implementable by a mechanism . Suppose that x ∈ F (θ ). Then, there exists a Nash equilibrium strategy profile m such that g (m) = x.
which represents the set of outcomes that individual i can generate by varying her own strategy, keeping the other individuals' equilibrium strategy choices fixed at m −i . Let us define the set which represents the set of outcomes that this individual can attain by playing truthful strategy choices for θ when the state moves from θ to θ , keeping the other individuals' equilibrium strategy choices fixed at m −i . Given this definition of S i θ ; x, θ , we refer to elements of S i θ ; x, θ as truthful outcomes for individual i at the state θ when the state moves from θ to θ and x ∈ F (θ ).
Part (1) in order to keep m as a Nash equilibrium strategy profile at θ it must be the case that x is strictly preferred by agent h to any truthful outcome in S h (θ ; x, θ) according to her ordering R h (θ ).
For part (2) of Condition μ * (ii), suppose that the state moves from θ to θ , that One can now see that only a partially-honest individual h can find it profitable to unilaterally deviate from m i , m −i -if no agent has incentive to unilaterally deviate, then y ∈ F θ , by the implementability, which is a contradiction.
Part (2)(a) specifies that if only individual i can find a unilateral profitable deviation no partially-honest individual can find a profitable unilateral deviation in order to eliminate y from the set of Nash equilibrium outcomes at θ = θ .
We are now ready to present our characterization result for unanimous SCRs. However, before stating it, we assume that the structure of the family H satisfies the following specification:

Assumption 2
The family H has as elements all non-empty subsets of the set N .
This requirement is consistent with, and a natural extension of Assumption 1 since the mechanism designer cannot exclude any member(s) of the society from being partially-honest purely on the basis of that assumption. Indeed, this assumption is the natural consequence of Assumption 1. The characterization theorem can be stated as follows: Theorem 1 Let n ≥ 3. Suppose that Assumptions 1-2 hold. The unanimous SCR F :

X satisfies Condition μ * (ii) if and only if it is partially-honestly Nash implementable.
Proof See Appendix A.
We make several remarks below regarding Theorem 1.

Remark 1
The "if" part of the theorem continues to hold if Assumption 2 is replaced with the requirement that the family H contains N or it is closed under union. H is closed under union when the following property holds: If H is an element of H and if H is another of its elements, then the union of these sets is also an element of H. Clearly, these specifications are weaker than Assumption 2. Moreover, the specification that H is closed under union has an obvious expansion-consistency interpretation: If the mechanism designer views H as a conceivable set of partially-honest individuals and he also views H as another conceivable set, then there is no reason for him to exclude their union from H purely on the basis of Assumption 1. The specification that H contains N is the minimal restriction on the family H that allows part (1)(b) of Condition μ * (ii) to still be a necessary condition for partially-honest implementation. The reason is that to assure it we need to be able to select a strategy profile m that generates the F -optimal outcome x at θ as a Nash equilibrium outcome for this θ and for a set of partially-honest individuals N which contains all elements of the family H, that is, H ⊆ N for every H ∈ H. This is because if N is an element of the family H, then the strategy profile m supporting the F-optimal x at the state θ as a Nash equilibrium of , ,θ,N is also a Nash equilibrium of , ,θ,H for every other allowable set H . This allows us to show that part (1)(b) of Condition μ * (ii) applies to whatever conceivable set of partially-honest individuals.
Remark 2 Condition μ * (ii) is a necessary condition for partially-honest Nash implementation when n ≥ 2 and when the family H is closed under union or it contains N .

Remark 3
The "only if" part of the theorem continues to hold if Assumption 2 is replaced with the requirement that the family H includes all singletons of the set N . This is because if m is a Nash equilibrium of some strategic game , ,θ,H and if individual i's strategy choice m i is a truthful one for the state θ , then this m is also a Nash equilibrium of the strategic game , ,θ,{i} provided that the singleton {i} is an element of H.
Common to the literature of implementation with partially-honest individuals is also the requirement that every member of society has a taste for honesty, as per Matsushima (2008b), Dutta and Sen (2012), Saporiti (2014) and Mukherjee et al. (2017). Thus, if we follow these authors and confine our analysis to this case, we have the following characterization theorem as well: Theorem 2 Let n ≥ 3 and let all individuals in N be partially-honest. Then, every unanimous SCR F : X is partially-honestly Nash implementable.
Proof It follows from the proof of Theorem 1, with the observation that in this case H = {N } and no Nash equilibrium strategy profile can fall into Rule 2.2 as well as into Rule 2.3 of the constructed mechanism. Indeed, when H = {N }, every unanimous SCR satisfies Condition μ * (ii) under the specification that the set Y = X and that In the following subsections, we propose several settings in which Theorem 1 is applied.

Applications to coalitional games
This subsection presents the core solution, which is the main set solution used for coalitional games, and it shows that this solution is not partially-honestly Nash implementable. It is well known that this solution is not Maskin monotonic and it violates the condition of no veto-power.
A coalitional game is a quadruplet (N , X , θ; υ) such that: • N is a finite set of individuals. A subset S of N is called a coalition. The class of all non-empty coalitions is denoted by P (N ). • X is a set of outcomes.
• θ is a state in .
• υ : P (N ) → 2 X is a function associating every element of class P (N ) with a subset of the set X , where 2 X is a family that has as elements all subsets of X . This function is called the coalitional function of the game. υ (S) specifies the set of outcomes for which coalition S has the power to move to. 8 Let (N , X , θ; υ) be a coalitional game. An outcome x ∈ X is weakly blocked by a coalition S ∈ P (N ) if there is an outcome y ∈ υ (S) such that y R j (θ ) x for every member j of S, with y P j (θ ) x for at least one of its members.

Definition 6
The core solution of a coalitional game (N , X , θ; υ), denoted by C, is the collection of all outcomes that are not weakly blocked by any coalition S, x ∈ X |for every S ∈ P (N ) and y ∈ υ (S) : x P j (θ) y for some j ∈ S, or x R j (θ ) y for all j ∈ S .
The following claim establishes the failure of partially-honestly Nash implementing the core solution when the mechanism designer knows what is feasible for every element of P (N ), that is, he knows the coalitional function, and he does not know the true state. 9 Claim 1 Let n ≥ 3. Let Assumption 2 be given. Then, the core solution does not satisfy Condition μ * (ii).
Proof Let the premises hold. Assume, to the contrary, that the core solution satisfies Condition μ * (ii).
Since the core solution is unanimous, Y = X as per Sjöström (1991), and so Y contains the range of C.
Suppose that there are three individuals and two states θ and θ . Individuals' preferences are represented in the table below: where, as usual, a b for individual i means that she strictly prefers a to b, while a, b means that this i is indifferent between a and b. Suppose that the coalitional function is defined as follows: In the coalitional game (N , X , θ; υ), the core solution contains only the outcome x. To see this, note that w is weakly blocked by coalition {1, 2} (via outcome x), and that y and z are both weakly blocked by coalition {2, 3} (via outcome w). However, in the coalitional game N , X , θ ; υ , the core solution contains only the outcome y since every other outcome is weakly blocked by coalition {1, 3}. Since x, θ and that the intersection S 1 θ ; x, θ ∩ I 1 θ , x, Y is not empty. 10 However, since x / ∈ S 1 θ ; x, θ and since I 1 θ , x, Y = {x}, it follows that the intersection S 1 θ ; x, θ ∩ I 1 θ , x, Y is empty, which is a contradiction.
We have proved the claim by assuming that n = 3. The proof will be identical for n > 3: just endow individual k > 3 with the same preferences of individual 3 considered above and just change the coalitional function as follows: Claim 1 still holds when Assumption 2 is replaced with the assumption that the family H includes all singletons. As noted above in Remark 2, Condition μ * (ii) is also a necessary condition for implementation when n = 2. By a reasoning like that used in the above claim, one can also show that the core solution violates Condition μ * (ii) when n = 2. 11

Applications to marriage problems
This subsection presents the basic model of matching men to women and shows that the man-optimal stable solution can be successfully partially-honestly Nash implemented. This result is in contrast to the literature on Nash implementation of matching solutions where no proper sub-solution of the stable solution is Nash implementable in the class of marriage games with singles-as per Kara and Sönmez (1996)-and where no single-valued sub-solution of the stable solution is Nash implementable in the class of pure marriage games, where being single is not a feasible choice or it is always the last choice of every individual-as per Tadenuma and Toda (1998).
A marriage problem is a quadruplet (M, W , θ, M) such that: • M is a finite non-empty set of men, with m as a typical element.
• W is a finite non-empty set of women, with w as a typical element. 11 To see this, suppose that there are two individuals and two states θ and θ . Individuals' preferences are represented in the table below: Suppose that the coalitional function is defined as follows: In the coalitional game (N , X , θ; υ), the core solution contains only the outcome x. In addition, in the coalitional game N , X , θ ; υ , the core solution contains only the outcome y. Thus, as in the above claim, x ∈ C (θ ) but x / ∈ C θ and, moreover, L 1 (θ, x) = L 1 θ , x and X ⊆ L 2 θ , x . Since the singleton {1} is an element of the family H, one can now easily check that the core solution violates part (2)(a) of Condition μ * (ii) under the specification that Y = X . The reason is that there cannot exist any outcome z = x in the set L 1 (θ, x) such that individual 1 is indifferent between this z and x according to her ordering R 1 θ .
• θ is a state such that (i) every man m ∈ M's preferences are represented by a linear ordering P m (θ ) over the set W ∪ {m} and (ii) every woman w ∈ W 's preferences are represented by a linear ordering P w (θ ) over the set M ∪ {w}. • M is a collection of all matchings, with μ as a typical element. μ : M ∪ W → M ∪ W is a bijective function matching every individual i ∈ M ∪ W either with a partner of the opposite sex or with herself. If an individual i is matched with herself, we say that this i is single under μ.
Let (M, W , θ, M) be a marriage problem. Every man m ∈ M's preferences over the set W ∪ {m} in the state θ can be extended to an ordering over the collection M in the following way: Likewise, this can be done for every woman w ∈ W .
Let (M, W , θ, M) be a marriage problem. A matching μ is individually rational in state θ if no individual i ∈ M ∪ W prefers strictly being single to being matched with the partner assigned by the matching μ; that is, for every individual i, either μ (i) P i (θ ) i or μ (i) = i. Furthermore, a matching μ is blocked in state θ if there are two individuals m and w of the opposite sex who would each prefer strictly to be matched with the other rather than with the partner assigned by the matching μ; that is, there is a pair (m, w) such that w P m (θ ) μ (m) and m P w (θ ) μ (w) .
A matching μ is stable in state θ if it is individually rational and unblocked in state θ . A matching μ is man-optimal stable in state θ if it is the best stable matching from the perspective of all the men; that is, m is stable in state θ and for every man m ∈ M, μR m (θ ) μ for every other stable matching μ in state θ . The man-optimal stable matching in state θ is denoted by μ θ .

Definition 7
The man-optimal stable solution of a marriage problem (M, W , θ, M), denoted by O M , is a function associating the state θ with its man-optimal stable matching μ θ , The following result shows that this solution is partially-honestly Nash implementable when the mechanism designer does not know the true state. We refer to (M, W , , M) as a class of marriage problems, with (M, W , θ, M) as typical marriage problem. Note that the man-optimal stable solution does not satisfy no veto-power (see, for instance, Kara and Sönmez 1996;Table I, p. 437). (M, W , , M) be a class of marriage problems with |M ∪ W | ≥ 3. Let Assumptions 1-2 be given. Then, the man-optimal stable solution is partiallyhonestly Nash implementable.

Proposition 1 Let
Proof Let the premises hold. In the context of matching problems, the set X coincides with the collection M, and N is the set M ∪ W . We show that the man-optimal stable solution satisfies Condition μ * (ii) with respect to Y = X .
Since the man-optimal stable solution is unanimous, we can set Y = X as per Sjöström (1991), and so Y contains the range of O M . In addition, for every triplet i, θ, θ , let C i θ, μ θ ≡ L i θ, μ θ and S i θ ; μ θ , θ ≡ C i θ, μ θ .
One can check that for every state θ , it holds that μ θ ∈ C i θ, μ θ ⊆ L i θ, μ θ ⊆ Y for every individual i. Moreover, for every triplet i, θ, θ , one can also check that the set S i θ ; μ θ , θ is non-empty and that O M θ ∈ S i θ ; μ θ , θ if θ = θ , establishing part (1) of Condition μ * (ii). Finally, let us show that the man-optimal stable solution satisfies part (2) of Condition μ * (ii).
For every quadruplet i, θ, θ , μ with μ ∈ C i θ, μ θ , suppose that C i θ, μ θ ⊆ L i θ , μ and that Y ⊆ L j θ , μ for every individual j = i. By construction, the man-optimal stable solution satisfies part (2) of Condition μ * (ii) if we show that μ is the man-optimal matching in state θ ; that is, μ = μ θ .
Assume, to the contrary, that μ = μ θ . Note that the matching μ is stable in state θ . So, by Theorem 2.13 in Roth and Sotomayor (1990;p. 33), which is due to Knuth (1976), it follows that μ θ R m θ μ for every man m ∈ M and that μR w θ μ θ for every woman w ∈ W . From this and the fact that the matching μ is also R j θmaximal for every individual j = i in the set Y , it follows that μ ( j) = μ θ ( j) if individual j is a man. Therefore, it must be the case that individual i is a man and the mate of the man i under μ θ differs from that under μ, that is, μ (i) = μ θ (i); otherwise, μ = μ θ , which is a contradiction.
Since μ (i) = μ θ (i) and since, moreover, μ θ R i θ μ, it follows from the definition of R i θ that μ θ P i θ μ. From this and the fact that the matching μ is stable in state θ , we have that the man i must be matched with a partner of the opposite sex under μ θ ; that is, μ θ (i) = w. Moreover, it must be the case that the mate of the woman w under μ θ differs from that under μ, that is, μ (w) = μ θ (w) = i; otherwise, the man i is matched with the same mate under μ and under μ θ , which contradicts that μ (i) = μ θ (i).
Since μ (w) = μ θ (w) = i and the matching μ is R w θ -maximal in the set Y for the woman w and since, moreover, μ θ is stable in state θ , it follows that μP w θ μ θ and that the mate of the woman w under μ is a man m = i. However, since the matching μ is R m θ -maximal in the set Y for the man m = i and since, moreover, μ θ R m θ μ, it must be the case that the man m is matched with the same woman w under μ and under μ θ , that is, μ (m) = μ θ (m) = w. This implies that the woman w is matched with the same mate under μ and under μ θ , that is, μ (w) = μ θ (w), which is a contradiction. Thus, we conclude that μ = μ θ .
Since the man-optimal stable solution satisfies Condition μ * (ii) with respect to Y ⊆ X , Theorem 1 implies that this solution is partially-honestly Nash implementable.

Applications to bargaining games
Last but not least, we look at the Nash implementability of the Nash (bargaining) solution. In the classical cooperative bargaining theory, initiated in Nash (1950), a number of individuals face the task of finding a unanimous agreement over the (expected) utility allocations resulting from the lotteries over a set of physical objects. The Nash solution, due to Nash (1950), selects the utility allocation that maximizes the product of the utilities over the feasible utility allocations. This allocation is now widely referred to as the Nash point.
The normative evaluation of the Nash solution is thus done entirely in utility space, based on the expected utility functions of the individuals. On the other hand, the objective of the abstract theory of Nash implementation is to help a uninformed mechanism designer to Nash implement outcomes satisfying certain desirable welfare criteria. This means that the shape of the utility space is unknown to the mechanism designer. One way to get these two classic areas of study closer has recently been suggested by Vartiainen (2007b) in the canonical cake sharing setting, which we follow in this last application.
We consider a situation where individuals bargain over the partition of one unit of a perfectly divisible commodity. Additionally, we assume that at each state every individual's preference over the set of possible agreements is represented by a continuous and increasing expected utility function. With these specifications, and when lotteries are feasible, every state generates a classic (non-empty, convex, compact and comprehensive) utility space. We thus require that the Nash solution associates, with each state, the set of all lotteries that generate the Nash point of the utility space generated by the state.
When both individuals and the mechanism designer know the size of the commodity and the space of lotteries but only individuals know the prevailing state, it is shown that the Nash solution can be Nash implemented in a setting with partiallyhonest individuals, though it violates the condition of no veto-power. This is a rather significant permissive result because several attempts have been made to give a noncooperative foundation to the Nash solution since Nash (1953). With the exception of Naeve (1999), 12 reconstructions of the Nash point as an equilibrium point of a mechanism are based on refinements of Nash equilibrium as solution concepts. See, e.g., Howard (1992) and Miyagawa (2002). 13 Formally, we assume that the set of possible divisions-allocations-of one unit of a perfectly divisible commodity among the n individuals is given by A ≡ {a ∈ R n + | n i=1 a i ≤ 1}, with a as a typical allocation and with a i as a typical fraction obtained by individual i at a. This set A is kept fixed throughout. In addition, we take the complete waste of the commodity as the disagreement point d = 0, which will also be the origin of the individual utilities.
A bargaining game is a triplet (N , , θ) such that: • N is a finite set of individuals, with n ≥ 2.
• is the set of outcomes, which consists of all probability measures on the Borel σ -algebra of the space A, with p as a typical element.
• θ is a state in , at which every individual j's preferences over [0, 1] are identified by a continuous and monotonic von Neumann-Morgenstern ordering. 14 Thus, individual j's preferences in state θ can be represented by a continuous, increasing and von Neumann-Morgenstern utility function u j (·; θ ) : [0, 1] → R such that individual j's expected utility of a probability measure p in is: for every p ∈ .
In addition, this utility function is uniquely determined up to a positive affine transformation. 15 Therefore, for the sake of simplicity, we also assume that u j (0; θ ) = 0 and that u j (1; θ ) = 1 in state θ .
Write (N , , ) for the class of bargaining games, with (N , , θ) as a typical element, where the set consists of all representations of continuous and monotonic orderings over [0, 1] that are consistent with the von Neumann-Morgenstern axioms; that is, the domain is unrestricted. To save writing, write U ( p; θ ) for the utility allocation (U 1 ( p; θ ) , . . . , U 1 ( p; θ )) generated by the outcome p in state θ .
Let (N , , θ) be a bargaining game. Define the utility possibility set associated with this bargaining game as: which is a non-empty, compact and convex set in R n . 16 In addition, since the utility functions representing individuals' preferences are increasing, this set U ( ; θ ) is also comprehensive, which amounts to free disposal of utility. 17 As already noted in Vartiainen (2007b), for every non-empty, convex and compact subset S of R n + there is a bargaining game (N , , θ) in the family (N , , ) for which the utility possibility set U ( ; θ ) is S; that is, U ( ; θ ) = S. Therefore, in the actual setting, every element of the class of standard bargaining problems in R n + is the image of some element of the family {U ( ; θ )} θ∈ of utility possibility sets generated by the class (N , , ) of bargaining games; that is, there is an onto function from the family {U ( ; θ )} θ∈ of utility possibility sets to the class of standard bargaining problems in R n + . Indeed, from the welfaristic viewpoint, that is, from the point of view where only utility allocations matter, these two classes are basically equivalent. 14 An ordering R j (θ ) on [0, 1] is monotonic if a j ≥ b j ⇒ a j R j (θ ) b j , for every a j , b j ∈ [0, 1]. 15 A function v : [0, 1] → R is a positive affine transformation of u j (·; θ ) if there exists a positive real number β > 0 and a real number γ such that v a j = βu j a j ; θ + γ , for every a j ∈ [0, 1]. 16 Its convexity follows from the Lyapunov's theorem for nonatomic vector measures, whereas its compactness follows from the fact the set U ( ; θ ) is the image of the compact set under the profile of continuous functions U (·; θ ) ≡ U j (·; θ ) j∈N (in the topology of weak convergence). 17 In symbols, a non-empty set S ⊆ R n is said to be comprehensive if x ∈ S and 0 ≤ y ≤ x together imply y ∈ S, where it is understood that for every two n-dimensional Euclidean vectors a and b, a ≥ b means that a i ≥ b i for every individual i, a > b means that a = b and a i ≥ b i for every individual i. (N , , θ), denoted by ν, is the collection of all outcomes p and q of that generate the same utility allocations U ( p; θ ) = U (q; θ ) and that maximize the product of utilities over the utility possibility set U ( , θ),

Definition 8 The Nash solution of a bargaining game
Thus, this solution is derived under the so-called welfaristic assumption: The solution depends only on the Nash property of the utility allocations.
Since the Nash solution is a risk sensitive bargaining solution, it follows from Vartiainen (2007b; Corollary 1, p. 343) that this solution fails Maskin monotonicity. 18 The following claim establishes that the Nash solution does not satisfy the no vetopower condition either: In the abstract Arrovian domain, the condition of no veto-power says that if an outcome is at the top of the preferences of all individuals but possibly one, then it should be chosen irrespective of the preferences of the remaining individual: that individual cannot veto it.
Claim 2 Let n = 3. Then, the Nash solution does not satisfy the condition of no veto-power. 19 Proof Since this solution is unanimous, we can set X = as per Sjöström (1991). Assume, to the contrary, that the Nash solution satisfies the condition of no veto-power.
By abuse of notation, write a for the degenerate probability measure in that picks the allocation a in A with certainty.
In the bargaining game (N , , θ), the utility allocation generated by the probability measure a 2 in state θ is U a 2 ; θ ≡ (0.5, 0.5, 0), which is an element of U ( ; θ ). Since the probability measure a 2 is an outcome for which U j (·; θ ) attains its largest value over the set X for individual j = 1, 2, no veto-power implies that this outcome is an element of the Nash solution at θ , that is, a 2 ∈ ν (θ ). By definition of the Nash solution, this means that the degenerate lottery a 2 maximize the product of utilities over the utility possibility set U ( , θ). Note that the Nash product of the utility allocation of the degenerated lottery a 2 is zero.
To derive a contradiction of the definition of the Nash solution, observe that, by construction, the Nash solution is not empty for the bargaining game (N , , θ). Moreover, let us consider the probability measure p ∈ defined by One can see that this probability measure generates a utility allocation equal to U p ; θ = (0.25, 0.25, 0.5), and so its Nash product is larger than zero, which is a contradiction.
In contrast with the above negative results, the Nash solution is partially-honestly Nash implementable when there are n ≥ 3 individuals:

Proposition 2 Let (N , , ) be a class of bargaining games with n ≥ 3. Let Assumption 1 and Assumption 2 be given. Then, the Nash solution is partially-honestly Nash implementable.
Proof Let the premises hold. In the context of bargaining games, the set X coincides with the space . We show that the Nash solution satisfies Condition μ * (ii) with respect to Y = X . A typical Nash-optimal outcome at state θ is denoted by p θ .
Since this solution is unanimous, we can set Y = X as per Sjöström (1991), and so Y contains the range of ν. In addition, let C i θ, p θ ≡ L i θ, p θ and S i θ ; p θ , θ ≡ ν (θ ) , for every pair (i, θ) ∈ N × .
One can check that for every state θ , it holds that p θ ∈ C i θ, p θ ⊆ L i θ, p θ ⊆ Y for every individual i. Moreover, one can also check that p θ ∈ S i θ ; p θ , θ , establishing part (1) of Condition μ * (ii) when θ = θ . Next, let us show that the Nash solution satisfies part (2) of Condition μ * (ii) when θ = θ . We do it by showing that the outcome q is a Nash-optimal outcome at state θ provided that this q ∈ L i θ, p θ is an outcome for which U i (·; θ ) attains its largest value on the set L i θ, p θ for some individual i and that this q is also an outcome for which U j (·; θ ) attains its largest value on the set Y for every other individual j. To see this, note that U i p θ ; θ = U i (q; θ ) and that U j (q; θ ) ≥ U j p θ ; θ for every individual j = i. By the efficiency of the Nash solution, it must be the case that U j (q; θ ) = U j p θ ; θ for every individual j = i. Thus, by the definition of the Nash solution it follows that q is an element of ν (θ ), as was to be shown. In summary, the Nash solution satisfies Condition μ * (ii) when θ = θ . 20 We next turn to deal with the case where θ = θ . Let us then first provide a construction of the set S i θ ; p θ , θ for every individual i when θ = θ . To this end, for every triplet i, θ, θ with θ = θ , define the set S i θ ; p θ , θ as follows: • For all q ∈ Y , if q ∈ C i θ, p θ ⊆ L i θ , q and Y ⊆ L j θ , q for every other individual j and if q / ∈ ν θ , then: • In all other cases, S i θ ; p θ , θ ≡ C i θ, p θ .
Firstly, suppose that the premises of part (2)(a) of Condition μ * (ii) never apply to outcomes in C i θ, p θ . Then, S i θ ; p θ , θ coincides with the non-empty set C i θ, x θ , which shows that part (1)(a) as well as part (2)(a) of Condition μ * (ii) are satisfied for this i.
Secondly, suppose that the premises of part (2)(a) of the condition apply to at least one outcome q ∈ C i θ, p θ . Then, to satisfy part (2)(a) of Condition μ * (ii) we need to have that this q is not an element of S i θ ; p θ , θ and, moreover, that the intersection S i θ ; p θ , θ ∩ I i θ , q, Y is not empty. This is the case by construction of the set S i θ ; p θ , θ provided that this set is not empty. Indeed, if the set S i θ ; p θ , θ is not empty, then Condition μ * (ii) is satisfied because there would exist an outcome r in S i θ ; p θ , θ such that the expected utility of individual i at r and at q in state θ is the same, that is, U i r ; θ = U i q; θ , establishing that the intersection S i θ ; p θ , θ ∩ I i θ , q, Y is not empty, as well as because every element of S i θ ; p θ , θ is an outcome of C i θ, p θ which results in a zero expected utility in state θ for every individual j = i , establishing that the outcome q cannot be an element of this S i θ ; p θ , θ .
Thus, to show that the set S i θ ; p θ , θ is not empty, it suffices to show that this set is not empty for every triplet i, θ, θ for which the premises of part (2)(a) of Condition μ * (ii) apply to some q ∈ C i θ, p θ . To this end, take any of these triplets and denote it by i, θ, θ .
Given that the utility allocation which assigns U i q; θ to individual i and zero to every other individual j is an element of the utility possibility set U ; θ , it follows from this that there is a probability measure s in which generates this utility allocation. From the available ones, let r denote the one for which it also holds that U i (q; θ ) = U i (r ; θ ). This r exists because the space of outcomes consists of all probability measures on the Borel σ -algebra of the space A. Thus, this r is an element of C i θ, p θ for which it holds that U i q; θ = U i r ; θ and that U j r ; θ = 0 for every individual j = i, establishing that the set S i θ ; p θ , θ is not empty.

A full characterization: a brief discussion of the necessary conditions
The characterization results presented above are limited to the class of unanimous SCRs. However, some interesting SCRs are not unanimous: a typical example of such a SCR is the egalitarian bargaining solution. In the standard Nash implementation theory, as Moore and Repullo's (1990) Condition μ(iii) states-see page 9 for a definition of Condition μ(iii), a SCR F must be unanimous with respect to a subset Y of X , with F ( ) ⊆ Y , if it is Nash implementable. Unfortunately, this condition is not a necessary one for partially-honest Nash implementation. Thus, we establish a new necessary condition, called Condition μ * (iii), which is sufficient for partiallyhonest Nash implementation when combined with Condition μ * (ii) and with another necessary condition, named Condition μ * (i). The conditions we have obtained are reasonably weak, albeit somewhat complex. For this reason, in this section, we provide an intuition of these conditions by focusing on the implementability of the egalitarian bargaining solution. A complete discussion of the full characterization is presented in Lombardi and Yoshihara (2019). Consider the set of allocations A ≡ {a ∈ R n + | n i=1 a i ≤ 1} as in Sect. 3.3. Assume that each agent is endowed with the class of the standard continuous, increasing, and concave utility functions defined over [0,1]. Then, as in Sect. 3.3, for each state θ , one bargaining problem is specified by a utility possibility set U (θ ). As the egalitarian bargaining solution is non-unanimous, we can specify a bargaining problem in which a unanimously best outcome does not support the egalitarian solution.
Consider a three-individual society and a bargaining problem in state θ which is defined by the comprehensive hull of a utility allocation (1, 1, 2), U (θ ) = comp {(1, 1, 2)}. Thus, one can easily see that the utility allocation (1, 1, 2) is unanimously most preferred, which is derived from an outcome x ∈ X in state θ , whereas the allocation (1, 1, 1) is the egalitarian utility allocation in state θ . Suppose that Assumptions 1-2 hold. Under such a bargaining problem, and given that x does not generate the egalitarian utility allocation but it generates the utility allocation (1, 1, 2), Condition μ * (iii) requires that, for each potential partially-honest individual i, that is, for each {i} ∈ H, there exists an outcome, y (i) , which is indifferent to the unanimously best outcome x for i. For instance, if i = 1, then the utility allocation corresponding to the outcome y (1) should be (1, 0, 0). 21 This is the case because for any implementing mechanism and for any message profile m supporting x / ∈ F (θ ) as an outcome of the outcome function, individual i's play m i is not a truthful strategy choice, that is, m / ∈ T i (θ ), and this individual has non-material incentives to play a truthful strategy choice m i ∈ T i (θ ) such that g m i , m −i = y (i) . This requirement applies to each individual i, by our Assumption 2. This is one of the requirements of Condition μ * (iii). However, this part of the condition open the following problem: What outcome should be selected by the outcome function when the outcome y (i) is not a top outcome according to each agent's ranking and when it does not generate the egalitarian utility allocation? The other requirements of Condition μ * (iii) provide an answer to this question. They do so by requiring for each H ∈ H, the existence of a common truthful feasible outcome, which is characterized by the fact that every partially-honest individual in H is playing a truthful strategy choice. Moreover, each of these requirements of Condition μ * (iii) states that if the specified common truthful outcome is a Nash equilibrium with partially-honest individuals at θ , then it generates the egalitarian utility allocation.
A full characterization of the class of SCRs that are partially-honestly Nash implementable is obtained by requiring that F jointly satisfies Condition μ * (iii), Condition μ * (ii) and another condition, named Condition μ * (i). Condition μ * (i) is our third necessary condition, which is a weak variant of Maskin monotonicity. Though from Theorem 1 and from Dutta and Sen (2012)'s Theorem, we know that no monotonicitytype condition is necessary for Nash implementation of unanimous SCRs, a weak variant of Maskin monotonicity is required to obtain our characterization result of non-unanimous SCRs.

Conclusions
The main practical aim of adopting an axiomatic approach to implementation theory is to distinguish between implementable and non-implementable SCRs. Drawing from the recent literature on implementation with partially-honest individuals, this paper identifies necessary and sufficient conditions for the Nash implementation of unanimous SCRs in a many-person setting with partially-honest individuals. The application of the necessary and sufficient conditions to test the implementability is relatively easy in many problems, as discussed in Sects. 3.1, 3.2, and 3.3. Existing literature on the subject has thus far offered only sufficient conditions in a variety of environments.
In an environment in which knowledge is dispersed, how individuals will interact with the mechanism designer is a natural starting point when it comes to Nash implement a SCR. A particular kind of communication is, as we have done in this paper, to ask participants to report the entire state of the world. There is, however, no reason to restrict attention to such schemes.
On this issue, Lombardi and Yoshihara (2018) have recently identified conditions for Nash implementation with partially-honest individuals which, if satisfied, send us back to the limitations imposed by Maskin's theorem. In terms of mechanisms, these conditions basically result in the impossibility to structure the communication in a way that does not allow the mechanism designer to elicit enough information of individuals' characteristics from the partially-honest participants. For instance, the limitations of Maskin's theorem remain valid when participants are asked to report only their own characteristics.
However, this does not mean that there are not mechanisms that resemble real-life mechanisms and that, at the same time, allow us to escape the limitations imposed by Maskin monotonicity in a setting with partially-honest individuals. One of these mechanisms is represented by the price-quantity mechanism [studied, for example, in Dutta et al. (1995), Sjöström (1996) and Saijo et al. (1996)], in which each individual chooses prices of commodities as well as a consumption bundle as her strategy choice. This is so because the announcement of prices serves the purpose to acquire some local information about individuals' indifference curves, such as the common marginal rate of substitution at an efficient allocation. Indeed, we now know that the Walrasian solution is Nash implementable in a many-person setting with partially-honest individuals by this type of market mechanism (see Lombardi and Yoshihara 2017). 22 Postlewaite and Schmeidler (1986), Palfrey and Srivastava (1989) and Jackson (1991) have shown that Maskin's theorem can be generalized to Bayesian environments. A necessary condition for Bayesian Nash implementation is Bayesian monotonicity. In a Bayesian environment involving at least three individuals, Bayesian monotonicity combined with no veto-power is sufficient for Bayesian Nash implementation provided that a necessary condition called closure and the Bayesian incentive compatibility condition are satisfied (Jackson 1991). Korpela (2014) studies Bayesian Nash implementation and provides sufficient conditions for implementation in a setting with partially-honest participants. This characterization result shows that Bayesian monotonicity becomes redundant in this environment, and so there are far fewer limitations for Bayesian Nash implementation when individuals have a taste for honesty. As yet, where the exact boundaries of those limitations lay for Bayesian environments is far from known. This subject is left for future research.
The same remark applies to implementation models based on the assumption that agents are maximin expected utility maximizers (Gilboa and Schmeidler 1989). Under this assumption, Guo and Yannelis (2018) are the first to study (full) implementation of social choice sets in essentially Bayesian Nash equilibrium with ambiguous beliefs, named implementation in ambiguous equilibrium. Echoing the results in Bayesian environments, Guo and Yannelis (2018) show that ambiguous incentive compatibility, ambiguous monotonicity and closure are necessary and almost sufficient for implementing any social choice set as ambiguous equilibria. 23 One would expect that ambiguous monotonicity would become redundant when individuals have intrinsic preferences for honesty. Again, this subject is left for future research.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Appendix A: Proof of Theorem 1
Let the premises hold. Suppose that SCR F : X satisfies unanimity. Let us first show that F satisfies Condition μ * (ii) with respect to Y ⊆ X if it is partially-honestly Nash implemented by the mechanism = (M, g). Let be the mechanism that partially-honestly Nash implements F. Then, T i θ = ∅ for every 22 The provided characterization does not rely on any sort of "tail-chasing" construction. pair i,θ ∈ N × and, moreover, it holds that F θ = N A , ,θ,H , for every pair θ ,H ∈ × H.
Thus, Y contains the range of F. For what follows, fix any pair (x, θ) ∈ Y × with x ∈ F (θ ). Given that N ∈ H by Assumption 2, there exists m such that g (m) = x and that m ∈ N E , ,θ,N . Thus, for every i ∈ N , let For what follows, fix also any pair θ , H ∈ × H. Given that g (m) = x and m ∈ N E , ,θ,N , define S i θ ; x, θ as follows: Clearly, S i θ ; x, θ = ∅ and, moreover, Next, we show that F satisfies part (1)(b) of Condition μ * (ii). Take any h ∈ H and suppose that θ = θ . Also, suppose that x / ∈ S h θ ; x, θ . It follows that m h / ∈ T h (θ ). Suppose that there exists z ∈ S h θ ; x, θ such that z R h θ x. Given that z ∈ S h θ ; x, θ , it follows that there exists m h ∈ T (θ ) such that g m h , m −h = z. Thus, m h , m −h ,θ h m, which contradicts that m ∈ N E , ,θ,N . We thus conclude that x P h (θ ) z for all z ∈ S h (θ ; x, θ).
Finally, we show that F satisfies part (2) of Condition μ * (ii). Fix any pair (i, y) ∈ N × C i (θ, x). Then, given that g (m) = x and m ∈ N E , ,θ,N , it follows that g m i , m −i = y for some m i ∈ M i . To economize on notation, we write m for m i , m −i .
Suppose that C i (θ, x) ⊆ L i θ , y and that Y ⊆ L j θ , y for all j = i. Moreover, suppose that y / ∈ F θ . By the partially-honest Nash implementability of F, we have only a partially-honest individual h ∈ H can find it profitable to unilaterally deviate from m . Thus, it is the case that m h / ∈ T h θ and that there is This shows that the intersection Assume, to the contrary, that x ∈ S j θ ; x, θ for all j ∈ H . Then, individual h ∈ H identified above can find a strategy choicem h ∈ T h θ such that g m h , m −h = x.
Since m h = m h / ∈ T h θ , it follows thatm h = m h and so individual h can break the strategy profile m from being a Nash equilibrium of , ,θ,H , which is a contradiction. Thus, it is the case that x / ∈ S j θ ; x, θ for some individual j ∈ H , establishing part (2) In what follows, we show that F is partially-honestly Nash implementable if it satisfies Condition μ * (ii) with respect to Y ⊆ X . Note that Y = X because F satisfies unanimity. To this end, suppose that F satisfies Condition μ * (ii) with respect to X .
Let us construct a mechanism which will partially-honestly Nash implement F. First, agent i's strategy choice space is defined by where is a non-empty set such that its intersection with is empty and that there is a bijection φ from to . This bijection is to make a code φ (θ ) to send the information of each state θ , rather than its direct message θ . Thus, individual i's strategy consists of an outcome in X , an element of the set ∪ and an individual index k ∈ N . A typical strategy played by individual i is denoted by m i = m i1 , x i , k i with m i1 as a typical element of ∪ . The strategy choice space of individuals is the product space M = i∈N M i , with m as a typical strategy profile.
For every pair θ , x ∈ × X with x ∈ F θ , define individual p's set σ p θ , x as follows: Write σ θ , x for a typical profile of sets, that is, σ θ , x = σ p θ , x p∈N ; and write σ p1 θ , x for a typical first coordinate of the set σ p θ , x . As F satisfies Condition μ * (ii), we can always specify a profile σ θ , x corresponding to each pair θ , x ∈ × X with x ∈ F θ . Indeed, for any of such pairs, the corresponding profile S p θ ; x,θ p∈N is specified by part (1)(a) of Condition μ * (ii). Then, given this profile S p θ ; x,θ p∈N , we can specify the profile σ θ , x in the following manner: if there exists a unique individual q ∈ N such that x ∈ S q θ ; x,θ and x / ∈ S j θ ; x,θ 24 Observe that m ∈ N E , ,θ,H given that m ∈ N E , ,θ,N and that H ⊆ N .
for any other individual j = q, then σ q θ , x = θ × {x} × N and σ j θ , x = φ θ × {x} × N for any j = q; otherwise, σ p θ , x = θ × {x} × N for any individual p ∈ N . Such a specification of σ θ , x will be used in the construction of the outcome function-see below. When agent p plays a strategy m p ∈ σ p θ , x such that m p1 = φ θ , our interpretation is that this agent is reporting the stateθ indirectly via φ. The reason is that φ is a bijection φ from to .
By means of the profile σ θ , x , let us introduce the notion of consistent strategy profile with respect to each pair θ , x ∈ × X with x ∈ F θ as follows.
Definition 9 For every pair θ , x ∈ × X with x ∈ F θ and every strategy profile x for one and only one individual i ∈ N .
In words, m is consistent with σ θ , x when every individual i is playing one of the strategies specified by σ i θ , x . m is quasi-consistent with σ θ , x if there exists only one agent i who is playing a strategy that is not included in σ i θ , x .
The outcome function g of the mechanism is defined by the following three rules: x for some i ∈ N , then we can have three cases: Rule 3: Otherwise, a modulo game is played: divide the sum i∈N k i by n and identify the remainder, which can be either 0, 1, . . ., or n − 1. The individual having the same index of the remainder is declared the winner of the game and the alternative implemented is the one she selects, with the convention that the winner is individual n if the remainder is 0. Note that in Rule 2-3, m i1 = θ i =θ / ∈ σ i1 θ , x implies that there exists one and only one individual q = i such that x ∈ S q θ ; x,θ and x / ∈ S j θ ; x,θ for every j ∈ N \ {q}. In contrast, in Rule 2-1, if m i1 =θ ∈ σ i1 θ , x , then there can be three cases: i is the unique individual who has x ∈ S i θ ; x,θ and x / ∈ S j θ ; x,θ for every j ∈ N \ {i}; there are at least two individuals p and q such that x ∈ S p θ ; x,θ ∩ S q θ ; x,θ ; or x / ∈ S p θ ; x,θ holds for any individual p. By the above definitions, we have that ≡ (M, g) is a mechanism. To paraphrase this mechanism: • Rule 1 corresponds to the case in which individuals play a message profile m that is consistent with σ θ , x . Therefore, given our interpretation of φ θ , this rule applies if each individual i plays a strategy m i ∈ σ i θ , x via which she announces θ as a state and x ∈ F θ as an outcome. • Rule 2 applies to situations where the message profile reported by agents is quasiconsistent with σ θ , x . Then, all but one agent make the same announcement about the stateθ and the outcome x ∈ F θ , and some individual i make an announcement m i such that m i / ∈ σ i θ , x . In that case, our outcome function distinguishes three cases. The outcome is x if all individuals make the same announcement about the statesee Rule 2.1. Rule 2.2 applies to cases in which agent i's announcement about the state is different from that reported by all other agents. In this case, the outcome is the x i announced by agent i if either x i is a truthful outcome according to the state announced by agent i-that is, x i ∈ S i θ i ; x,θ , or x i is not a truthful outcome according to agent i's announcement but it is an attainable outcome-that is, x i ∈ C i θ , x \S i θ i ; x,θ -and x i is better than any other truthful outcome in S i θ i ; x,θ -see parts (a)-(b) of Rule 2.2. The outcome is y if x i is not a truthful outcome according to agent i's announcement but it is an attainable outcome, and if this y is a truthful outcome according to the state announced by agent i and it is as good as x i according to the ordering corresponding to the state announced by agent i-see parts (c) of Rule 2.2. The outcome is z ∈ S i θ i ; x,θ if the outcome announced by agent i, x i , is not an attainable outcome, that is, x i / ∈ C i θ , x -see part (d) of Rule 2.2. Rule 2.3 applies to cases in which all individuals make the same announcement about the state and agent i's announcement about the state is such that m i1 = θ i =θ / ∈ σ i1 θ , x . In this case, the outcome is the x i announced by agent i if x i is a truthful outcome according to the state announced by agent i. Otherwise, the outcome is z for some z ∈ S i θ i ; x,θ .
• Rule 3 applies the remaining announcements that do not fall under Rule 1 or Rule 2. The outcome is the alternative announced by the winner of the modulo game.
We show that this partially-honestly implements F. For every individual i, define the truth-telling correspondence as follows: Suppose that x ∈ F (θ ). Given that the profile σ (θ, x) is well defined, take any strategy profile m that is consistent with σ (θ, x). Thus, m falls into Rule 1 and x = g (m). We claim that m ∈ N E , ,θ,H .
To see this, first observe that any deviation of j will get her to an outcome in C j (θ, x) by Rule 2, and so g M j , m − j ⊆ C j (θ, x). Since C j (θ, x) ⊆ L j (θ, x), such deviations are not profitable if j / ∈ H . To see that such deviations are also not profitable for j ∈ H , we proceed according to whether σ j1 (θ, x) = {θ } or not.
In summary, j's deviations from m are not profitable, and so m ∈ N E , ,θ,H , as we sought.
For the converse, suppose that m ∈ N E , ,θ,H . We show that g (m) ∈ F (θ ). To obtain a contradiction, we suppose that g (m) / ∈ F (θ ). We proceed by cases.

Case 1 m falls into Rule 3
Given the richness of the strategy space, we see that X ⊆ g M j , m − j for every j. Since m ∈ N E , ,θ,H , it follows that X ⊆ L j (θ, g (m)) for every j. Given that the SCR F is unanimous, g (m) ∈ F (θ ), which is a contradiction. Case 2 m falls into Rule 1 Then, g (m) = x. Note that Condition μ * (ii) implies that x ∈ C j θ , x for each j ∈ N . If θ =θ , there is an immediate contradiction. We thus suppose that θ =θ . Then, g (m) ∈ S i θ i ; x,θ . Given that in this case it must hold that m i / ∈ σ i θ , x and that m i1 = θ i =θ / ∈ σ i1 θ , x , it follows from the definition of the profile σ θ , x and the fact that m falls into Rule 2.3 that x ∈ S q θ ; x,θ for one and only one individual q = i, 25 and so g (m) = x. We proceed according to whether θ =θ or not. Sub-case 4.1 θ = θ i =θ Observe that x / ∈ S i (θ ; x, θ) given thatθ / ∈ σ i1 θ , x . Suppose that i ∈ H . Given that i can attain x by inducing Rule 1, we have that x ∈ g (M i , m −i ). Given that m ∈ N E , ,θ,H , it also holds that g (m) R i (θ ) x. However, since x ∈ C i (θ, x) ⊆ L i (θ, x) and, moreover, g (m) ∈ S i (θ ; x, θ) ⊆ C i (θ, x), it follows that x I i (θ ) g (m), which contradicts part (1)(b) of Condition μ * (ii). Therefore, it must be the case that i / ∈ H . Suppose that H \ {q} = ∅. Then, take any h ∈ H \ {q}. Note that m h / ∈ T h (θ ) given that σ h1 (θ, x) = {φ (θ )}. This h can change m h into m h = θ, g (m) , k h ∈ T h (θ ) so as to induce Rule 3. To attain g (m), h has only to adjust k h so as to win the modulo game. Thus, m h , m −h ,θ h m, which contradicts that m ∈ N E , ,θ,H . Otherwise, let H \ {q} = ∅. Given that H = ∅ and that i / ∈ H , we are left to consider the case where H = {q}. Recall that x ∈ S q (θ ; x, θ) for one and only one individual q = i.
Let us show that X ⊆ L j (θ, g (m)) for every j = i. To this end, take any z ∈ X \ {x} and any j = i. By changing m j into m j = φ (θ ) , z, k j , j can induce Rule 3. To attain z, this j has only to adjust k j so as to win the modulo game. To attain x, j has only to adjust k j so as to allow k ∈ N \ {i, j} to win the modulo game. Thus, we have that X ⊆ g M j , m − j and so X ⊆ L j (θ, g (m)) given that m ∈ N E , ,θ,H , as was to be shown.
Next, let us show that C i (θ, x) ⊆ L i (θ, g (m)). To attain x, i can change m i into any strategy choice in σ i (θ, x) and induce Rule 1. Thus, x ∈ g (M i , m −i ). Since g (m) ∈ C i (θ, x) and C i (θ, x) ⊆ L i (θ, x) and, moreover, since m ∈ N E , ,θ,H , we see that x I i (θ ) g (m). By transitivity, it follows from C i (θ, x) ⊆ L i (θ, x) that C i (θ, x) ⊆ L i (θ, g (m)).
Since X ⊆ L j (θ, g (m)) for every j = i and C i (θ, x) ⊆ L i (θ, g (m)) and since, moreover, H = {q} and g (m) / ∈ F (θ ), part (2)(b) of Condition μ * (ii) implies that x / ∈ S q (θ ; x, θ), which is a contradiction. Sub-case 4.2 θ = θ i =θ We show that m / ∈ N E , ,θ,H . Note that m h / ∈ T h (θ ) for every h ∈ H . Fix any h ∈ H . Suppose that h = i. This i can change m i into m i = 25 If q = i, then σ i1 θ , x = θ , which is not the case. θ, g (m) , k i ∈ T i (θ ) so as to induce Rule 2.2 and to obtain g m i , m −i such that g m i , m −i I i (θ ) g (m). 26 Therefore, m i , m −i ,θ i m, yielding a contradiction. Thus, suppose that h = i. This h can change m h into m h = θ, g (m) , k h ∈ T h (θ ) so as to induce Rule 3. To attain g (m), h has only to adjust k h so as to win the modulo game. Again, m h , m −h ,θ h m, which is a contradiction. Case 5 m falls into Rule 2.2 Let us show that X ⊆ L j (θ, g (m)) for every j = i. To this end, take any z ∈ X \ {x} and any j = i. By changing m j into m j = φ (θ ) , z, k j , j can induce Rule 3. To attain z, this j has only to adjust k j so as to win the modulo game. To attain x, j has only to adjust k j so as to allow k ∈ N \ {i, j} to win the modulo game. Thus, we have that X ⊆ g M j , m − j and so X ⊆ L j (θ, g (m)) given that m ∈ N E , ,θ,H . Since the choice of j is arbitrary, we have that X ⊆ L j (θ, g (m)) for each j = i.
Next, let us show that C i θ , x ⊆ L i (θ, g (m)). To attain x, i can change m i into m i ∈ σ i θ , x and induce Rule 1. Thus, x ∈ g (M i , m −i ). Let us proceed according to whether θ =θ or not.
Suppose thus that θ =θ . By changing m i into m i = φ (θ ) , z i , k i with z i ∈ S i θ ; x,θ , i can induce part (a) of Rule 2.2 and obtain this z i . It follows that i can also attain any outcome in S i θ ; x,θ , establishing that S i θ ; x,θ ∪ {x} ⊆ L i (θ, g (m)). Assume, to the contrary, that there exists w ∈ C i θ , x \S i θ ; x,θ such that w P i (θ ) g (m). By transitivity, we see that S i θ ; x,θ ∪ {x} ⊆ SL i (θ, w). Individual i can change m i into m i = φ (θ ) , w, k i so as to obtain g m i , m −i = w by part (b) of Rule 2.2, which contradicts that m ∈ N E , ,θ,H . Thus, we conclude that C i θ , x ⊆ L i (θ, g (m)).
(+) Suppose that σ h1 θ , x = φ θ for some h ∈ H \ {i} if the set H = {i}. Then, m h / ∈ T h (θ ). By changing m h into m h = θ, g (m) , k h ∈ T h (θ ), h can induce Rule 3. To attain g (m), this h has only to adjust k h so as to win the modulo game. It follows that m h , m −h ,θ h m, which contradicts that m ∈ N E , ,θ,H . Therefore, it must be the case that σ h1 θ , x = θ for every h ∈ H \ {i} if the set H = {i}.
We distinguish the following cases: (1) i / ∈ H , (2) H = {i} and (3) i ∈ H and H ∩ (N \ {i}) = ∅. Sub-case 5.1 i / ∈ H Suppose thatθ = θ . Then, m h / ∈ T h (θ ) for each h ∈ H . Fix any h. The contradiction that m / ∈ N E , ,θ,H follows from the argument used above in (+). Thus, in what follows, we assume thatθ = θ . We distinguish whether x ∈ S h (θ ; x, θ) for some h ∈ H or not. Rule 2.3 and obtain g m i , m −i = z, which contradicts that m ∈ N E , ,θ,H . We conclude that m i ∈ T i (θ ).