Voting Game Theory Problem

**Voting **

- Three voters vote over two candidates (A and B), and each voter has two pure strategies: vote for A and vote for B.
- When A wins, voter 1 gets a payoff of 1, and 2 and 3 get payoffs of 0; when B wins, 1 gets 0 and 2 and 3 get 1. Thus, 1 prefers A, and 2 and 3 prefer B.
- The candidate getting 2 or more votes is the winner (majority rule).

**Find all very weakly ****dominant strategies (there may be more than one, or none).**

Find **all pure strategy Nash equilibria (there may be more than one, or none)?**