Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Matching pennies. In this simple two-player game, the players (call them Rand C) each choose an outcome, heads or tails. If both outcomes are equal, Cgives a dollar to R; if the outcomes are different, Rgives a dollar to C.

(a) Represent the payoffs by a2×2 matrix.

(b) What is the value of this game, and what are the optimal strategies for the two players?

Short Answer

Expert verified

The value of the game is0 and the optimal strategy of both the player will be equal i.e., 12.

Step by step solution

01

Represent the payoffs by a matrix.

(a)It is given that forR to win, the two coins must have same outcome, i.e., either both heads or both tails.

The above condition can be represented as:

H

T

H

+1

-1

T

-1

+1

The matrix represents the moneyR got by game.

H=Head,T=Tail

+1indicates thatR got a dollar whereas-1 shows thatC got a dollar.

02

Calculate the value of this game and the optimal strategies for the two players

(b)

Let, Probability of Rto get head and tail be given asX1and X2.

And, Probability of Cto get head and tail be given as y1and y2.

Max:z: Min:w

zx1x2       zx1+x2    x1+x2=1        x1,x2>0 ​​   

wy1y2wy1+y2y1+y2=1y1,y2>0

The value of this game is0 .

Therefore, the optimal strategy of both the player is equal to i.e., 12.

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 Vaia!

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

In a particular network G = (V, E) whose edges have integer capacities ce, we have already found the maximum flow f from node to node t. However, we now find out that one of the capacity values we used was wrong: for edge (u, v) we used cuv whereas it should have been cuv. -1 This is unfortunate because the flow f uses that particular edge at full capacity: f = c.

We could redo the flow computation from scratch, but there’s a faster way. Show how a new optimal flow can be computed inO(|V|+|E|) time.

There are many common variations of the maximum flow problem. Here are four of them.

(a) There are many sources and many sinks, and we wish to maximize the total flow from all sources to all sinks.

(b) Each vertex also has a capacity on the maximum flow that can enter it.

(c) Each edge has not only a capacity, but also a lower bound on the flow it must carry.

(d) The outgoing flow from each node u is not the same as the incoming flow, but is smaller by a factor of (1-U), whererole="math" localid="1659789093525" u is a loss coefficient associated with node u.

Each of these can be solved efficiently. Show this by reducing (a) and (b) to the original max-flow problem, and reducing (c) and (d) to linear programming.

You are given the following points in the plane:

(1,3),(2,5),(3,7),(5,11),(7,14),(8,15),(10,19)

.You want to find a lineax+by=c that approximately passes through these points (no line is a perfect fit). Write a linear program (you don’t need to solve it) to find the line that minimizes the maximum absolute error,max1i7|axi+byic|

The Canine Products company offers two dog foods, Frisky Pup and Husky Hound, that are made from a blend of cereal and meat. A package of Frisky Pup requires 1 pound of cereal and 1.5pounds of meat, and sells for \(7. A package of Husky Hound uses 2 pounds of cereal and 1 pound of meat, and sells for \)6. Raw cereal costs\(1per pound and raw meat costs\)2per pound. It also costslocalid="1658981348093" \(1.40to package the Frisky Pup and localid="1658981352345" \)0.60to package the Husky Hound. A total of localid="1658981356694" 240,000pounds of cereal and pounds of meat are available each month. The only production bottleneck is that the factory can only package 110,000bags of Frisky Pup per month. Needless to say, management would like to maximize profit.

(a) Formulate the problem as a linear program in two variables.

(b) Graph the feasible region, give the coordinates of every vertex, and circle the vertex maximizing profit. What is the maximum profit possible?

Find necessary and sufficient conditions on the reals a and b under which the linear program

maxx+yax+by1x,y0

(a) Is infeasible.

(b) Is unbounded.

(c) Has a unique optimal solution.

See all solutions

Recommended explanations on Computer Science 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.

Sign-up for free