1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Nana76 [90]
3 years ago
8

Consider the following game, called matching pennies, which you are playing with a friend. Each of you has a penny hidden in you

r hand, facing either heads up or tails up (you know which way the one in your hand is facing). On the count of "three," you simultaneously show your pennies to each other. If the face-up side of your coin matches the face-up side of your friend’s coin, you get to keep the two pennies. If the faces do not match, your friend gets to keep the pennies.a. Who are the players in the game? Whatare each players strategy?b. Is there a dominant strategy? If so what?c. Is there an equilibrium?
Mathematics
1 answer:
Dahasolnce [82]3 years ago
7 0

Answer:

a. The two players playing the game

b. No dominant strategy

c. No equilibrium

Step-by-step explanation:

a. The players are the two people playing the game of matching pennies

The strategy of the players are to meet the conditions of them keeping the pennies by having either heads or tails

The payoff of the game are as follows;

Player A keeps the two pennies when the outcome matches

Player B keeps the two pennies when the outcome does not match

The payoff of the game are as follows;

                                                Player A

                                             Head                          Tails

Player B  Head                     1, -1                              -1, 1

               Tails                      -1   1                               1, -1

Where:

x, y

x = Player A

y = Player B

1 = Getting to keep the two pennies

-1 = Losing a penny

b. There are no best strategy because the game is one of chance whereby the result of the strategy of one player depends on the side of the penny facing up by the other player.

c. There is no equilibrium as the possible outcomes are equal hence the outcomes can be even or one sided.

You might be interested in
Please help me answer this question
boyakko [2]

Answer:

Step-by-step explanation:

Well I can't really write this into an equation but all the class has to do is buy 272 class rings.

5 0
3 years ago
Which values are in the solution set of 111 = z^2 + 11 if the replacement set is {10, 12, 14, 16, 18}?
pantera1 [17]

Answer:

10

Step-by-step explanation:

Z ^2+11=111

Z ^2=100

Z=10

8 0
3 years ago
Suppose the Tower of Hanoi rules are changed so that stones may only be transferred to an adjacent clearing in one move. Let In
Svet_ta [14]

Answer:

l_n=3^n-1

Step-by-step explanation:

We will prove by mathematical induction that, for every natural n,  

l_n=3^n-1

We will prove our base case (when n=1) to be true:

Base case:

As stated in the qustion, l_1=2=3^1-1

Inductive hypothesis:  

Given a natural n,  

l_n=3^n-1

Now, we will assume the inductive hypothesis and then use this assumption, involving n, to prove the statement for n + 1.

Inductive step:

Let´s analyze the problem with n+1 stones. In order to move the n+1 stones from A to C we have to:

  1. Move the first n stones from A to C (l_n moves).
  2. Move the biggest stone from A to B (1 move).
  3. Move the first n stones from C to A (l_n moves).
  4. Move the biggest stone from B to C (1 move).
  5. Move the first n stones from A to C (l_n moves).

Then,

l_{n+1}=3l_n+2.

Therefore, using the inductive hypothesis,

l_{n+1}=3l_n+2=3(3^n-1)+2=3^{n+1}-3+2=3^{n+1}-1

With this we have proved our statement to be true for n+1.    

In conlusion, for every natural n,

l_n=3^n-1

8 0
3 years ago
In quadrilateral ABCD AB||CD and m/_2 =31 what is m/_5
Lady_Fox [76]

Answer:

5 is ALSO 31⁰ BECAUSE THE LINES ARE PARALLEL

GIVE BRAINLIEST PLZ

6 0
3 years ago
Richard rolls a fair dice 420 times.<br> How many times would Richard expect to roll a four?
Arada [10]
70 times, because there is one four, giving him the change of 1/6
6 0
3 years ago
Other questions:
  • A 16\dfrac1216 2 1 ? kilometer stretch of road needs repairs. Workers can repair 2\dfrac142 4 1 ? kilometer of road per week. Ho
    11·1 answer
  • Need help factoring this binomial: x^4-1?
    7·2 answers
  • How would you solve for this
    12·1 answer
  • Plz help answer these!!! WILL MARK AS BRAINLIEST!!!
    6·2 answers
  • Graph the linear inequality x&lt;-3 on a coordinate plane
    6·1 answer
  • What is the decimal equivalent of 5 over 9.? 0 point 5 bar. 0 point 6 bar. 0 point 8 bar. 0 point 9 bar.
    10·2 answers
  • I’ll give points + brainslist, if you don’t know don’t bother answering (:
    9·1 answer
  • Write an equation of the line in slope-intercept form.
    11·1 answer
  • John walks from his front door to the grocery store 500m away. He walks at a
    9·1 answer
  • 9 to the power of - half is equal to (as a fraction) 27 to the power of a quarter over 3 to the power of x-1
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!