An algorithm for verifying double implementability in Nash and strong Nash equilibria (Q5932220)

The author [``Double implementation in Nash and strong Nash equilibria'', Soc. Choice Welfare 14, 439-447 (1997; Zbl 0881.90012)], considered a decision making problem where there is a set of options and a finite number of agents with preferences defined over the set of options, and obtained a necessary and sufficient condition for double implementation in Nash and strong Nash equilibria. One problem with the condition is that it is difficult to apply it directly to a given (social choice) correspondence. In the present paper the author provides an algorithm which helps to determine whether or not a correspondence satisfies the condition.