In this note we discuss two examples of appoval voting games. The first one, with six voters and three candidates, has a unique stable set,where each voter approves only his most preferred candidate. This strategy coincides with the sophisticated one, while other strategy combinations, leading...

We prove two results on the generic determinacy of Nash equilibrium in voting games. The first one is for negative plurality games. The second one is for approval games under the condition that the number of candidates is equal to three. These results are combined with the analogous one obtained...

We present a simple voting environment where the Condorcet winner exists. Under plurality rule, the derived game has a stable set where such a candidate is elected with probability one. However, no stable set of the approval game elects the Condorcet winner with positive probability.