Irresolute mechanism design: a new path to possibility

Often preferences in a group of agents are such that any sensible goal must admit a tie between all alternatives. The standard formulation in mechanism design demands that in this case all alternatives must be equilibrium outcomes of the decision making mechanism. However, as far as the idea of an equilibrium is to predict the outcome, we could equally well require that there are no equilibria at all. Although this may seem innocent, it allows the mechanism designer to implement goals that are impossible to enforce with any other implementation concept, like mixed Nash implementation, subgame perfect implementation, or Nash implementation using undominated strategies.


Introduction
The fact that social choice theory was born in the aftermath of Arrow's impossibility theorem (Arrow 1963) was an omen of things to come: Results in this field have had a negative connotation ever since, either saying that no goal of society can satisfy certain desiderata (Arrow 1963;Fishburn 1973;Sen 1970), or that there would be no reliable way to collect the information that is needed anyway (Barberá 1997;Ching and Zhou 2002;Duggan and Schwarz 2000;Gibbard 1997Gibbard , 1973;;Gärdenfors 1976;Kelly 1977;Sato 2008;Satterthwaite 1975). 1 The second problem is more fundamental in the sense that, at the end of the day, society has to make a decision.
To formulate the second problem exactly, and to also define concepts that are need later on, let N = {1, … , n} be the set of agents, A the set of alternatives, Θ = Θ 1 × ⋯ × Θ n the set of states, and ⪰ i the preference relation of agent i at state .Furthermore, suppose that the state space is unrestricted, 2 and the goal of the mechanism designer, or the choice rule (CR), can be represented as a mapping f ∶ Θ → A that associates an acceptable alternative f ( ) ∈ A to each state ∈ Θ .Then, either the process of collecting private information is not reliable in the sense that some individual i has an incentive to misrepresent his or her information at some state = ( 1 , 2 , … , n ) , that is or choice rule f has other undesirable features − it is dictatorial (selects the best alternative of the same agent at all states) or it has only 2 alternatives in the range i.e. | f (Θ) |= 2.3 This is the famous Gibbard-Satterthwaite-theorem (Gibbard 1973;  Satterthwaite 1975), and a choice rule that is not prone to this type of misrepresentation is called strategy-proof.
Two possible ways to escape this impossibility suggest themselves immediately.The outcome could be random, or it could be an entire set of alternatives.Unfortunately, both generalizations arrive at a similar conclusion as the GS-theorem.In the first case dictatorship is just replaced with random dictatorship (Gibbard 1997), 4 and in the second case, a similar conclusion holds for all sensible ways to generalize the concept of misrepresentation so that it applies for correspondences (Barberá et al. 2001;Ching and Zhou 2002;Duggan and Schwarz 2000).
After the birth of mechanism design in the late 1960s and early 1970s, pioneered by Leonid Hurwicz, Stanley Reiter, Eric Maskin, and Roger Myerson, new possibilities began to emerge. 5Unfortunately, in the case of unrestricted state space, this approach has not lead that far.Now we know that if the Nash equilibrium correspondence of a decision mechanism is a function, then it is either dictatorial, constant, or selects between two alternative only, and in all other cases, it tends to be too large in the sense of selecting too many alternatives at each state.On the other hand, while some refinements of Nash equilibrium admittedly give more permissive results, like virtual implementation (Abreu and Sen 1990), subgame perfect implementation (Abreu and Sen 1990;Moore and Repullo 1998;Vartiainen 2007), and 1 To name put a few from a large and still expanding literature.
2 Unrestricted state space means that for any preference profile ⪰= (⪰ 1 ⪰ 2 , … , ⪰ n ) , there exists a state ∈ Θ , such that ⪰ i =⪰ i for all i ∈ N.

3
Irresolute mechanism design: a new path to possibility implementation using undominated strategies (Palfrey and Srivastava 1991), they all have well-known problems, and moreover, Nash equilibrium is certainly the most natural solution concept since it demands the least amount of cognitive power from agents.
In retrospect it seems that about the only way to realize a choice rule with good properties is to identify logical connections in the set of preferences − Black's singlepeaked domain with the median voter rule being a case in point (Black 1948;Blin and Satterthwaite 1946;Moulin 1980).6This is often unsatisfactory, and utterly so as a general solution, since there is nothing to guarantee that such a logic will suggest itself or even be there.Although the common explanation that preferences of voters are single-peaked over the left-right -axis is intuitively compelling, is there any strong reason why voters would conceptualize things like this, or is it rather so that in most voting situations a natural assumption is that the state space is unrestricted.Of course, if we admit this, then we have to admit that social choice theory is really facing an impossibility that seems inescapable.
In this paper we argue that this would be a hasty conclusion.There is a little shortcoming in the original definition of Nash implementation that has substantial implications for the impossibility result; when all alternatives of A are acceptable, rather than demanding all alternatives to be equilibrium outcomes, as the standard formulation does, we could equally well require that none of them are.If the mechanism designer does not care what the outcome is, then he does not need to predict it.The reason why this innocent change expands the set of implementable choice rules is simple.Each equilibrium in a decision making mechanism under one preference profile implies constraints on what can be selected at other preference profiles through monotonicity which is a necessary condition for implementation (Maskin (1999)).When a choice rule regards all alternatives to be equally good, a large bundle of constraints is generated, some of which are necessarily strong.For if all alternatives are equally good for the collective, then those alternatives that are valued highly by some of the agents, must usually be valued little by others.However, selecting a low ranked alternative at some state generates a lot of constraints for other states through monotonicity.In this paper we reformulate the definition of implementation in these lines and show that the impossibility result does not hold anymore.
The rest of this paper is organized as follows.In Sect. 2 we propose a modification of the standard mechanism design problem that is more in line with the interpretation of equilibrium as a prediction.Although we do not want to rename old concept, but since this serves us well, we call the standard formulation resolute mechanism design and the new formulation irresolute mechanism design.Then, in Sect.3, we derive some general results.In particular, we show that a condition called irresolute monotonicity is necessary for implementation, and when combined with a condition called strict no-veto power, a strengthening of the standard no-veto power condition, it becomes sufficient.Section 4 shows that our modification expands the set of Nash implementable choice rules even in the domain of all strict preferences; a specific Condorcet extension is now implementable in the case of 3 agents and 3 alternatives, something that was not possible in the standard sense.In Sect. 5 we show that in some specific cases irresolute mechanism design is able to go beyond the most powerful implementation concepts like mixed strategy Nash implementation, subgame perfect implementation, and even Nash implementation using undominated strategies.Section 6 concludes with a short discussion.
2 The devil is in the details: resolute vs. irresolute mechanism design Hurwicz (1960Hurwicz ( , 1972) ) was the first to give an explicit formulation of the idea that the goal of a society can be separated from the mechanism that is used to realize it.7 Given n message spaces M 1 , … , M n , one for each agent, a mechanism g is a mapping Let us denote M = M 1 × ⋯ × M n and write this mechanism as G = (M, g) .In con- trast to strategy-proofness, where the only concern is whether individuals have an incentive to lie or not, we need to be more exact on what kind of behavior is expected.A natural assumption is that a Nash equilibrium will be played.
Naturally, whether a given message is a Nash equilibrium or not, will depend on the true state.Once a state ∈ Θ has been given, and preferences are therefore fixed, mechanism G becomes a game Γ( ) = (G, ) .A message profile m * = (m * 1 , … , m * n ) is a pure strategy Nash equilibrium of this game if, and only if, g(m * ) ⪰ i g(m i , m * −i ) holds for all i ∈ N and all m i ∈ M i . 8The set of all pure strategy Nash equilibrium profiles of Γ( ) is denoted by NE(G, ) .Now we can formulate what Hurwicz meant; In words, exactly those alternatives that choice rule f regards as acceptable are Nash equilibrium outcomes of G at all admissible states.The path-breaking result of Maskin (1999) says that if a choice rule is Nash implementable, then it is (Maskin) monotonic, and if it is monotonic and satisfies also no-veto power (NVP), then it is Nash implementable. 9Let L i (x, ) ≡ {y ∈ A | x ⪰ i y} be the lower contour set of x for agent i at state .Choice rule f is monotonic, if for all , ∈ Θ , and all x ∈ f ( ) 7 Historical details are given in Jackson (2001); Maskin (1999), andMoore (1996). 8Here as usual. 9A full characterization (a necessary and sufficient condition) was later given by Moore and Repullo (1990) and Sjöström (1991).
Irresolute mechanism design: a new path to possibility for all ∈ Θ , and all x ∈ A , if x is the best alternative of at least n − 1 agents at state , then x ∈ f ( ).
Although this approach helps, it does not get us far in the case of unrestricted domain, which, as we have argued, is often the most natural assumption.According to Maskin (1999) a choice rule that satisfies Definition 1 must be monotonic, and if it is single-valued as well, then the result of Muller and Satterthwaite (1977) says that it must be strategy-proof.Therefore, by the GS -theorem, the choice rule must be either dictatorial, constant, or select between two alternatives only.However, although correspondences do not help with strategy-proofness, they do now.Maskin (1999) shows that the Pareto correspondence, which selects all Pareto optimal alternatives at each state, and also the individually rational correspondence, which for a fixed alternative, selects all those alternatives that are considered at least as good by all, are both Nash implementable by a resolute mechanism.Unfortunately, we are still left with two well-known problems: (1) The set of alternatives that these correspondences regard as acceptable are too large (even a dictatorial rule is Pareto optimal) and ( 2) once the mechanism has multiple equilibria at each state this will almost certainly lead to a coordination failure (what is the equilibrium that one anticipates others to play).
We propose a novel approach to overcome some of these difficulties.To introduce the idea, let N = {1, 2, 3} , A = {x, y, z} , and suppose that preferences at state are given below: These preferences exhibit what is known as a majority-or Condorcet cycle (Fishburn 1977;Young 1988) − but this is not the point.The point is that while it is natural to insist that choice rule f must selects all alternatives at state , that is f ( ) = A , it is not equally natural to insist that g(NE(G, )) = A as in Definition 1.We could just as well allow NE(G, ) = � or equivalently g(NE(G, )) = �.10After all, if the mechanism designer does not care what is the final outcome, what difference does it make if the mechanism does not have an equilibrium?It is not like agent refuse to participate simply because an equilibrium does not exist.This is even more evident if the mechanism treats all alternatives equally.
OBSERVATION: As far as the idea of an equilibrium is to predict the outcome of a mechanism, there is no need for a decision making mechanism to have an equilibrium when all alternatives are considered equally good.⋄ Whether this is the purview of game theory community in general, and opinions to the contrary have certainly been presented, it is clear that without this interpretation the enterprise of mechanism design would be pretty much void. 11Despite of what the commonly accepted view is, or whether there even exist one, this observation does suggest that a certain amount of slack is possible in Definition 1.
For a given CR f ∶ Θ → A , let us define the set of resolute states Θ f ,R ⊆ Θ as In words, Θ f ,R is the set of those states where all alternatives are not considered equally good.Accordingly, let Θ f ,I ≡ Θ ⧵ Θ f ,R be the set of irresolute states.
Definition 2 (Irresolute Mechanism Design).Choice rule f ∶ Θ → A is Nash imple- mentable by an irresolute mechanism if there exists a subset of states Θ f ,R ⊆ Θ D ⊆ Θ , and a mechanism G = (M, g) , such that (1) f ∶ Θ D → A is implementable in the standard sense (Definition 1), and ( 2) In words, if all possible outcomes in the range of the mechanism are not desirable, then we have to make sure that we restrict Nash equilibrium outcomes to those alternatives that we like, and if the range of the mechanism is equal to the set of desirable outcomes, then it is possible, but not necessary, to allow that there are no Nash equilibria at all.This definition is not directly related to what is known as partial implementation.A CR f ∶ Θ → A is called partially implementable if there exists an implementable CR g ∶ Θ → A such that g() ⊆ f () holds for all ∈ Θ .In other words, f is partially implementable if there is a mechanism where at least one socially optimal alternative is a Nash equilibrium outcome, while it is not allowed that there are no equlibria at all. 12 Upon reflection we may argue that it does not matter whether the mechanism has other solution besides Nash equilibrium in case (2) of the above definition.If it does we still accomplish implementation in the partial sense.
Definition 2 goes directly against an old tradition in social choice theory that consider consistency as an important property of a mechanism (Abdou and Keiding 1991;Dufwenberg and Stegman 2002;Dutta 1984;Dutta and Pattanaik 1978;Peleg 1984Peleg , 1978)).Consistency means that at least one equilibrium must exists at all states.On the other hand, since we violate this property in the weakest possible way, we should rather worry whether it make any difference at all.Two things indicate that it might.First of all, we know from the work of Saari (2001Saari ( , 1995) ) that a small set of preference profiles are behind most of the problems, and second, recent developments in mechanism design show that a seemingly innocent assumption can have a huge effect. 13 11 See (Fudenberg and Tirole 2000;Luce and Raiffa 1957;Myerson 1991, Osborne andRubinspsstein (1993) or Schelling (1960) for the standard interpretation and Aumann (1987); Binmore (1990) or Rubinstein (1991) for a critical view. 12See Thomson (1996) for a discussion of different implementation concepts. 13See the work of Dutta and Sen (2012) on mechanism design with partially honest agents.

3
Irresolute mechanism design: a new path to possibility

General results
The following condition holds a similar position in irresolute mechanism design as monotonicity does in resolute mechanism design.

Definition 3
We say that CR f ∶ Θ → A is irresolute monotonic if there exists a sub- set of states Θ f ,R ⊆ Θ D ⊆ Θ such that; (i) f ∶ Θ D → A is monotonic, (ii) for any ∈ Θ ⧵ Θ D , and any x ∈ A , there does not exist a state ∈ Θ D such that x ∈ f ( ) and L i (x, ) ⊆ L i (x, ) holds for all i ∈ N.
Theorem 1 If CR f ∶ Θ → A is Nash implementable by an irresolute mechanism, then it must be irresolute monotonic.
Proof Let G = (M, g) be an irresolute mechanism that Nash implements f.Let Θ D be the set of all states such that g(NE(G, Then, since f ∶ Θ D → A must be Nash implementable in the standard sense, it has to be monotonic.Hence (i) holds.Now take any ∈ Θ ⧵ Θ D and any x ∈ A .For the sake of contradiction, suppose there exists a state ∈ Θ D , such that x ∈ f ( ) and L i (x, ) ⊆ L i (x, ) holds for all i ∈ N .By definition of Θ D there is a Nash equilib- rium m * ∈ NE(G, ) such that g(m * ) = x .However, by nestedness of the lower con- tour sets, m * is then a Nash equilibrium also at state .This is a contradiction with the fact that ∈ Θ⧵Θ D .Hence also (ii) holds.◻ Irresolute monotonicity is close to a full characterization.Just like monotonicity it becomes sufficient when combined with a NVP type condition.

Definition 4
We say that CR f ∶ Θ → A satisfies strict no-veto power (SNVP) if for all ∈ Θ , and all x ∈ A , if x is the top alternative of at least n − 1 agents at state , then f ( ) = {x} .◻ In comparison to NVP, which requires that under these conditions x ∈ f ( ) must hold, SNVP requires that only x is acceptable at state .
monotonic and satisfies SNVP, then it is Nash implementable by an irresolute mechanism.
Proof We use the Maskin mechanism (Maskin 1999) restricted to states Θ D to prove the claim.Let the message space of agent i be M i = Θ D × A × ℕ + , denote a typical message of agent i by m i = ( i , x i , n i ) , and define the outcome function g ∶ M → A by the following three rules: (1) If m i = ( , x, n i ) for all i ∈ N , and x ∈ f ( ) , then g(m) = x.
(2) If m j = ( , x, n j ) for all j ∈ N⧵{i} , m i = ( i , x i , n i ) , and x ∈ f ( ) , then (3) In all other cases, denote k = argmax i∈N n i , and set g(m) = x k .
Let us verify that G = (M, g) implements f ∶ Θ → A .First of all, since SNVP implies NVP, we know from Maskin (1999) that G Nash implements f ∶ Θ D → A .Therefore, we only need to consider states in Θ ⧵ Θ D .Suppose that ∈ Θ⧵Θ D .There cannot exist any Nash equilibria under rule (1) at since this would violate condition (ii) of irresolute monotonicity.Assume, then, that there is a Nash equilibrium under rule (2) or (3).By the definition of G together with SNVP this implies that f ( ) is a singleton, which is a contradiction, since Θ ⧵ Θ D means that f ( ) = A by definition.This means that the mechanism has no Nash equilibria at .Therefore, f is Nash implementable by an irresolute mechanism.
◻ As we argued in the previous section, it does not really matter how agents behave in those cases where Nash equilibrium fails to exists, since the mechanism in Theorem 2 will partially implement the CR anyway.In some specific cases it may be possible to prove a stronger result, however, if one can show that when there are no Nash equilibria, there are no rationalizable strategies either. 14This would mean that there is no reasonable prediction to be made, and therefore, one can argue that no alternative is in a favorable position.It is important to understand that the mechanism in Theorem 2 does not have any mixed strategy equilibria at any state (Maskin 1999).15 Therefore, at irresolute states Θ ⧵ Θ D , there really are no equilibria, pure or mixed.

Condorcet correspondence with three alternatives
Theorem 2 characterizes almost all CRs that are Nash implementable by an irresolute mechanism.We give an example to shows that this class includes at least some important rules.Suppose there are three agents N = {1, 2, 3} , three alternatives to choose form A = {x, y, z} , and all profiles of strict orderings are possible.Alterna- tive x ∈ A is a Condorcet winner at state if it beats all other alternatives in a pair- wise comparison.This means that at least two individuals prefer x to y and at least two individuals prefer x to z.In the case of 3 alternative, there is either a unique Condorcet winner, or all alternatives are Condorcet winners.Thus, let us define choice rule f Con ∶ Θ → A as: 1 3 Irresolute mechanism design: a new path to possibility In the literature f Con is called a Condorcet extension (Young 1988; Fishburn 1977).Furthermore, in this simple case of 3 agents and 3 alternatives, most, if not all, reasonable Condorcet extensions coincide with f Con .Since exactly all strict rank- ings are possible, there are 6 3 = 216 preference profiles in the domain of f Con , only 12 of which do not have a Condorcet winner.In fact, f Con is the closest thing to a function that one can hope for in this domain without violating either anonymity or neutrality.16 Lemma 1 f Con is not Nash implementable by a resolute mechanism.
Proof This follows from the result of Maskin (1999) once we have shown that f Con is not monotonic.Suppose that at state preferences are: Thus, f Con ( ) = A by definition.Suppose, then, that at state preferences are instead: We get these from the preferences at by propping x above z in the ranking of agent 3. Now f Con ( ) = {x} by definition.Therefore, f Con is not monotonic, since mono- tonicity would imply that y ∈ f Con ( ) , and as a consequence not Nash implementa- ble by a resolute mechanism either.◻ At this point it must be stressed that f Con is not partially implementable either.Now consider the CR f Con ∶ Θ R → A .As there are only 12 profiles where a unique Condorcet winner does not exist, Θ R is almost as large as Θ.
x, if x is a Condorcet winner at , A, otherwise.
Proof The fact that Condorcet winner is always unique when the domain is Θ R implies monotonicity.Suppose that {x} = f Con ( ) .If alternative x does not drop in the preferences of anyone when going from state to state , in the sense that L i (x, ) ⊆ L i (x, ) holds for all i ∈ N , then it must beat the other two alternatives in a pairwise comparison also at state .Hence {x} = f Con ( ) as required by monotonic- ity.◻ Taken together, Lemmas 1 and 2 clearly indicate that those 12 preference profiles where Condorcet winner does not exist are behind most of the problem.But can an irresolute mechanism help us?Next we show that it can.
Proof If at least two individuals think that alternative x is the best at state , then it must clearly be a unique Condorcet winner, and therefore {x} = f Con ( ) .Thus, f Con satisfies SNVP.◻ Theorem 3 f Con is Nash implementable by an irresolute mechanism.
Proof By Lemma 3 f Con satisfies SNVP.Therefore, by Theorem 2, we only need to show that f Con is irresolute monotonic.Let us show that we can set Θ D = Θ R .From Lemma 2 we know that f Con ∶ Θ R → A is monotonic.Hence (i) in the definition of irresolute monotonicity is satisfied.To verify also (ii), suppose to the contrary; for some ∈ Θ⧵Θ R , and some x ∈ A , there exists a state ∈ Θ R such that x ∈ f ( ) and L i (x, ) ⊆ L i (x, ) holds for all i ∈ N .Since x is then a Condorcet winner at , by definition, it must be Condorcet winner also at by the nestedness of the lower contour sets.This is a contradiction.Thus, also (ii) holds, and hence f Con satisfies irresolute monotonicity.◻

Relation to existing literature
In an important step forward, Mezzetti and Renou (2012) studied Nash implementation in mixed strategies.In this work the set of Nash implementable CRs is extended by allowing some alternatives at some states to be in a support of a non-degenerate mixed strategy equilibrium rather than an outcome of a pure strategy equilibrium as originally proposed in Maskin (1999).This means that some acceptable alternatives may not be chose for sure in any equilibrium.The necessary condition that this new definition leads to is called set-monotonicity.17 Definition 5 A choice rule f ∶ Θ → A is set-monotonic if for all , ∈ Θ , we have f () ⊆ f () whenever one of the following two conditions holds for all i ∈ N : 1 3 Irresolute mechanism design: a new path to possibility either (1) f () ⊆ max  i A or (2) for all x ∈ f ( ) , both (i) L i (x, ) ⊆ L i (x, ) and (ii) SL i (x, ) ⊆ SL i (x, ) hold.
Set-monotonicity is much weaker than monotonicity.Moreover, just like monotonicity, it becomes suffcient when combined with NVP.One result in Mezzetti and Renou (2012) is that top-cycle correspondence is implementable in mixed strategy equilibrium.This implies, in particular, that the correspondence f Con studied in Sect. 4 is implementable in mixed strategy equilibrium.However, as an equilibrium concept, mixed strategies are much more controversial than pure strategies (Rubinstein 1991).Therefore, it is nice to know that there are other ways to implement f Con , although it is not in general possible to implement the top-cycle correspond- ence using an irresolute mechanism.However, as the following example shows, implementation in mixed strategy equilibrium is not strictly stronger than Nash implementation by an irresolute mechanism.
Example.Let Θ = { , 1 , 2 , 3 , 4 } , A = {x, y, z, v} , and N = {1, 2, 3, 4} .Pref- erences at states and 4 are given below: and Agent 1: Preferences at states { 1 , 2 , 3 } are defined similarly; at i agents N ⧵ {i} have the same preferences as at , while agent i is indifferent between all alternative.Now suppose that the mechanism designer wants to implement a CR such that f ( ) = {x, y, z, v} = A , f ( 1 ) = {v} , f ( 2 ) = {z} , f ( 3 ) = {y} , and f ( 4 ) = {x} .This is arguably the most sensible goal in this particular case; alternatives hold symmetric positions at state , while at state 4 , for instance, it is alternative x that has improved the most (agents 1,2 and 3 have the same preferences at both states).This CR does not satisfy set-monotonicity, and therefore, it is not implementable in mixed strategy equilibrium.This is because set-monotonicity requires that f () ⊆ f ( 4 ) must hold since, looking back at Definition 5, condition (1) holds for agent 4, while condition (2) holds for all the rest.This CR is Nash implementable by an irresolute mechanism.This follows from Theorem 2. f satisfies SNVP and the CR f ∶ Θ R → A , where Θ R = { 1 , 2 , 3 , 4 } , is irresolute monotonic.Hence we can select Θ D = Θ R .This example is a formal description of the following fable.Suppose that the mechanism designer knows the preferences of all agents in some community as exemplified by state .However, by the time that a decision has to be made, member i may have already decided to leave the community and therefore turned indifferent on what happens as exemplified by state i .In this situation the interpretation the CR is clear − the preferences of the member who has decided to leave should not interfere.This is one of those cases where Nash implementation by an irresolute mechanism is useful, while mixed strategy Nash implementation is not.
But this CR is not implementable in most other solution concept either.For example, it does not satisfy Condition , which is necessary for subgame perfect implementation (Abreu and Sen 1989;Vartiainen 2007).
Definition 6 Choice rule f ∶ Θ → A satisfies Condition with respect to the set B ⊆ A , if f (Θ) ⊆ B , and if for all states , ∈ Θ and all outcomes x ∈ f ( ) − f ( ) , there exists a sequence of agents j(0), j(1), … , j(l) and a sequence of outcomes is maximal in B for all agents except j(l), then either l = 0 or j(l − 1) ≠ j(l).
It is obvious why the CR in our Example cannot satisfy this condition.The preference reversal required by items (i) and (ii), that is x l ⪰ j(l) x l+1 and x l+1 ≻  i j(l) x l , cannot be there since only the preferences of agent i change and then this agent is indifferent between all alternatives.Furthermore, as subgame perfect implementation is one of the most powerful forms of implementation, there is not much hope for any other solution concept either.Even Nash implementation using undominated strategies does not work here (Palfrey and Srivastava 1991).Any undominated Nash equilibrium at is clearly an undominated Nash equilibrium at i too.

Concluding discussion
Instead of defining a CR f ∶ Θ → A to be irresolute if it selects all alternatives A at some states, we could equally well treat irresoluteness as part of the design.Suppose that CR f is not implementable.Furthermore, at some state , the set f ( ) of acceptable alternatives includes almost all alternative, while the alterna- tives A ⧵ f ( ) are not that much worse either.In this case the designer could try 1 3 Irresolute mechanism design: a new path to possibility to use an irresolute mechanism to implement f with the exception that all alternatives are acceptable at .In other words, the designer could implement a nearby rule rather than f itself.
The idea of this paper can be generalized much further though.We could equally well study a situation where dominant strategies are chosen whenever they exist, but otherwise Nash equilibrium is going to be played, or subgame perfect equilibrium is going to be selected whenever it exist, but otherwise Nash equilibrium is chosen.This can be a fruitful avenue for further research.
Funding Open Access funding provided by University of Turku (UTU) including Turku University Central Hospital.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material.If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.To view a copy of this licence, visit http:// creat iveco mmons.org/ licen ses/ by/4.0/.