Undominated strategies and coordination in normalform games (Q2641200)

This paper studies procedures for collective decision making that ensure that collective decisions are Pareto-efficient provided that all agents choose strategies that are not weakly dominated. We first show that such procedures always exist. We then introduce the notion of a ``compromise'', and investigate whether, within the considered class of procedures, there are procedures which do not exclude compromises. We show, using some additional assumptions, that the answer is positive. Finally, we ask whether within the considered class of procedures there are procedures which automatically guide agents to compromises. We show, again using some additional assumptions, that the answer to this question is negative.