18.7k views
5 votes
There are two presidential candidates, John and Dustin, who will choose which states they will visit to garner votes. Suppose that there are four states that are in play, but candidate Dustin only has the money to visit three states. If John visits a state, the gain (or loss) in his poll numbers is indicated as the payoffs in the following matrix: Change in Polls State 1 State 2 State 3 State 1 1 -8 11 State 2 -4 7 -1 State 3 6 2 3 State 4 -2 1 -3 The row player is John and the column player is Dustin. This is a zero-sum game. Set-up the problem as a linear program, then use excel solver to find the solution. You have two attempts. Your grade will be the highest of the two attempts.

Which states should John visit in their optimal strategy?

1 Answer

3 votes

Final answer:

In this zero-sum game, John and Dustin are choosing states to visit for campaigning. To determine John's optimal visiting strategy, we set up a linear program using Excel Solver, incorporating the payoff matrix and the constraint that Dustin can only visit three states.

Step-by-step explanation:

The scenario provided is a zero-sum game in which two presidential candidates, John and Dustin, have to choose states to visit in an election campaign. To solve the problem using linear programming, we can use the payoff matrix provided to establish variables that represent the strategies for both candidates. The objective of John is to maximize his gain, while Dustin will try to minimize John's gain since it's a zero-sum game. Because Dustin can only visit three states, this additional constraint must be included in the model.

Without the specifics of the payoff matrix entries and the exact constraints, it's not possible to give a precise answer to which states John should visit. Yet, the approach would involve setting up decision variables for each state John could visit, defining the objectives and constraints based on the payoff matrix, and then using Excel Solver to find the optimal strategy.

For example, if John decides to visit State 1 or not could be represented as a binary variable (1 for visiting, 0 for not), with similar variables for other states. The constraints would ensure that Dustin visits exactly three states and that the choices adhere to the rules of a zero-sum game. After setting up the model in Excel, Solver can be used to find the optimal strategy that maximizes John's expected poll changes.

The outcome of the game theory scenario goes beyond the matrix solution, touching on public opinion and campaign donations, as seen in real-life elections. Strategies deployed by candidates may include targeting specific demographics or states based on various perceptual and financial factors, as highlighted by the examples from the 2016 presidential campaign. These strategies directly influence fundraising efforts, where candidates who perform well in public opinion polls tend to receive more donations, thus possibly affecting their abilities to campaign effectively.

User TheGreenCabbage
by
9.0k points