/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 39 \mathrm{\\{} G a m e ~ T h e o r... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

\mathrm{\\{} G a m e ~ T h e o r y ~ - ~ P o l i t i c s ~ I n c u m b e n t ~ T a x ~ \(\mathrm{N}\). Spend and chal- lenger Trick L. Down are running for county executive, and polls show them to be in a dead heat. The election hinges on three cities: Littleville, Metropolis, and Urbantown. The candidates have decided to spend the last weeks before the election campaigning in those three cities; each day each candidate will decide in which city to spend the day. Pollsters have determined the following payoft matrix, where the payoff represents the number of votes gained or lost for each one-day campaign trip. T. N. Spend \begin{tabular}{|l|c|c|c|} \hline & Littleville & Metropolis & Urbantown \\ \hline Littleville & \(-200\) & \(-300\) & 300 \\ \hline Metropolis & \(-500\) & 500 & \(-100\) \\ \hline Urbantown & \(-500\) & 0 & 0 \\ \hline \end{tabular} T. L. Down What percentage of time should each candidate spend in each city in order to maximize votes gained? If both candidates use their optimal strategies, what is the expected vote?

Short Answer

Expert verified
In order to maximize votes gained, T. N. Spend should spend approximately 28.57% of their time in Littleville, 42.86% in Metropolis, and 28.57% in Urbantown. T. L. Down should spend 42.86% of their time in Littleville, 21.43% in Metropolis, and 35.71% in Urbantown. When both candidates use their optimal strategies, the expected vote is approximately -78.41 in favor of T. L. Down.

Step by step solution

01

Identify the Payoff Matrix

First, let's write down the payoff matrix in a more convenient form: \[ \begin{bmatrix} -200 & -300 & 300 \\ -500 & 500 & -100 \\ -500 & 0 & 0 \end{bmatrix} \] The rows of the matrix represent T. N. Spend's decisions and the columns represent T. L. Down's decisions. The numbers inside the matrix represent the number of votes gained or lost for T. N. Spend for each one-day campaign trip.
02

Find the Optimal Mixed Strategies for Both Candidates

To find the optimal mixed strategies for both Incumbent T. N. Spend and Challenger T. L. Down, we need to solve the Linear Programming Problem (LPP) for both the row player (T. N. Spend) and the column player (T. L. Down). Row player's LPP: \[ \begin{array}{lll} \textrm{Maximize } & v \\ \textrm{Subject to } & \begin{bmatrix} -200 & -300 & 300 \\ -500 & 500 & -100 \\ -500 & 0 & 0 \end{bmatrix} \begin{bmatrix} p_1 \\ p_2 \\ p_3 \end{bmatrix} \leq v \\ & \sum p_i = 1 \\ & p_i \geq 0 \end{array} \] Column player's LPP: \[ \begin{array}{lll} \textrm{Minimize } & u \\ \textrm{Subject to } & \begin{bmatrix} -200 & -500 & -500 \\ -300 & 500 & 0 \\ 300 & -100 & 0 \end{bmatrix} \begin{bmatrix} q_1 \\ q_2 \\ q_3 \end{bmatrix} \geq u \\ & \sum q_i = 1 \\ & q_i \geq 0 \end{array} \] Solving these linear programming problems, we find the following optimal mixed strategies for both T. N. Spend and T. L. Down: \(p^* = \begin{bmatrix} 0.2857 \\ 0.4286 \\ 0.2857 \end{bmatrix}\), (T. N. Spend should spend approximately 28.57% of the time in Littleville, 42.86% in Metropolis, and 28.57% in Urbantown) \(q^* = \begin{bmatrix} 0.4286 \\ 0.2143 \\ 0.3571 \end{bmatrix}\), (T. L. Down should spend approximately 42.86% of the time in Littleville, 21.43% in Metropolis, and 35.71% in Urbantown)
03

Determine the Expected Vote

The expected vote can be calculated as: \(v = p^* \cdot A \cdot q^* = \begin{bmatrix} 0.2857 & 0.4286 & 0.2857 \end{bmatrix} \begin{bmatrix} -200 & -300 & 300 \\ -500 & 500 & -100 \\ -500 & 0 & 0 \end{bmatrix} \begin{bmatrix} 0.4286 \\ 0.2143 \\ 0.3571 \end{bmatrix} = -78.41\) The expected vote (number of votes gained for T. N. Spend) is approximately -78.41, which means T. L. Down is expected to gain 78.41 votes. In conclusion, T. N. Spend should spend approximately 28.57% of the time in Littleville, 42.86% in Metropolis, and 28.57% in Urbantown to maximize votes gained. T. L. Down should spend approximately 42.86% of the time in Littleville, 21.43% in Metropolis, and 35.71% in Urbantown. The expected vote with both candidates using their optimal strategies is -78.41 in favor of T. L. Down.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

Payoff Matrix
The Payoff Matrix is a fundamental tool in game theory representing the outcomes of different choices made by the players. In the context of politics, as seen in our example, candidates T. N. Spend and T. L. Down choose where to campaign to maximize their votes. Each cell in the matrix corresponds to the number of votes gained or lost when both candidates pick certain cities to campaign in.

Understanding the payoff matrix is critical for strategizing. It outlines not only the direct consequences of a player's action but also the interdependent outcomes that result from the actions of the opposing player. For T. N. Spend, a negative number in the matrix means a loss in votes, whereas a positive number represents a gain, relative to the decisions of T. L. Down.
Linear Programming Problem
The Linear Programming Problem (LPP) provides a mathematical approach to find the optimal strategy in a game. In our political scenario, both candidates face an LPP to determine the proportion of time to campaign in each city that would maximize their expected votes.

For T. N. Spend, we formulate an LPP to maximize a variable, which we call v, indicating the number of votes. Constraints are set based on the payoff matrix outcomes and probabilities, ensuring that the total probability adds up to 1 and that each probability, indicating time spent in each city, is non-negative. Similarly, T. L. Down has a set of linear inequalities to minimize u, aiming to reduce the votes for the opponent. The solutions to these problems help in identifying the Optimal Mixed Strategies for both candidates, informing them how to allocate their time across the cities.
Optimal Mixed Strategies
The concept of Optimal Mixed Strategies in game theory involves choosing a mixture of possible actions (strategies) in proportions that maximize the player's payoff, given the strategies of the other players. It is an equilibrium where any changes in strategy will not yield a better outcome for any player.

In the steps provided, we follow a linear programming approach to identify these strategies. Optimal mixed strategies take into account the randomness and unpredictability inherent in political campaigns, allowing candidates like T. N. Spend and T. L. Down to spread their efforts across several options (cities, in this case) to hedge against the uncertainties. Following the calculated mixed strategies would result in an approximate balance in their campaigns, optimizing their expected votes given the uncertainty of their opponent's actions.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Can the following linear programming problem be stated as a standard maximization problem? If so, do it; if not, explain why. \(\begin{array}{ll}\text { Maximize } & p=-3 x-2 y \\ \text { subject to } & x-y+z \geq 0 \\ & x-y-z \geq-6 \\ & x \geq 0, y \geq 0, z \geq 0 .\end{array}\)

Solve the LP problems. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. Maximize \(\quad \begin{aligned} \quad p=3 x+2 y & \\ \text { subject to } & 0.1 x+0.1 y \geq 0.2 \\ y & \quad x \geq 0, y \geq 0 . \end{aligned}\)

The political pollster Canter is preparing for a national election. It would like to poll at least 1,500 Democrats and 1,500 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost \(\$ 40\) each to produce and mail, mailings to the Midwest cost \(\$ 60\) each, and mailings to the West Coast cost \(\$ 50\) each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost? What will it cost? What are the shadow costs of a Democratic response and a Republican response?

$$ \begin{array}{ll} \text { Minimize } & c=6 s+6 t \\ \text { subject to } & s+2 t \geq 20 \\ & 2 s+t \geq 20 \\ & s \geq 0, t \geq 0 \end{array} $$

\(\nabla\) Scheduling Because Joe Slim's brother was recently elected to the State Senate, Joe's financial advisement concern, Inside Information Inc., has been doing a booming trade, even though the financial counseling he offers is quite worthless. (None of his seasoned clients pays the slightest attention to his advice.) Slim charges different hourly rates to different categories of individuals: \(\$ 5,000 /\) hour for private citizens, \(\$ 50,000 /\) hour for corporate executives, and \(\$ 10,000 /\) hour for presidents of universities. Due to his taste for leisure, he feels that he can spend no more than 40 hours/week in consultation. On the other hand, Slim feels that it would be best for his intellect were he to devote at least 10 hours of consultation each week to university presidents. However, Slim always feels somewhat uncomfortable dealing with academics, so he would prefer to spend no more than half his consultation time with university presidents. Furthermore, he likes to think of himself as representing the interests of the common citizen, so he wishes to offer at least 2 more hours of his time each week to private citizens than to corporate executives and university presidents combined. Given all these restrictions, how many hours each week should he spend with each type of client in order to maximize his income?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.