upper lim.Problem 13, A Quiz game has 2 questions. The problem is: which question to attempt first.If the first question is answered correctly then the second question can be attempted. If the first answer iswrong, the game stops.Question 1 will be answered correctly with probability 0.8 with a prize of $100. Question 2 will beanswered correctly with probability 0.5 with a prize of $200.Let Y = the amount of money won if Question 1 is attempted firstLet Z= the amount of money won if Question 2 is attempted firsta) Write the probability distribution of Yb) Find E[Y]c) Write the probability distribution of Zd) Find E[Z]e) Which is greater, E[Y] or E[Z]?Bonusf) Assume we choose the first question at random. If the probability of picking Question 1 is 0.4, findE[X], where X Total amount of money won in the game.%3D

As per policy i can answer only first three subparts for answers of other parts please ask…

Answered: a) Write the probability distribution…

Engineering

Computer Science

a) Write the probability distribution of Y b) Find E[Y] c) Write the probability distribution of Z

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter13: Decision Making Under Uncertainty

Section13.2: Utility Theory

Problem 11P

See similar textbooks

Similar questions

In the refrigerator example, suppose the warranty worksas follows. If a refrigerator fails at any time within 5 yearsof purchase, we give the consumer a prorated refund on the$500 purchase price. For example, if the refrigerator failsafter 4 years, we pay the customer $100. If the refrigeratorfails after 3 years, we pay the customer $200. Estimate ourexpected warranty expense per refrigerator sold.
The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M = 0 and N = 5, players are eliminated in order, and player 5 wins. If M = 1 and N = 5, the order of elimination is 2, 4, 1, 5. Write a C program to solve the Josephus problem for general values of M and N. Try to make your program as efficient as possible. Make sure you dispose of cells. What is the running time of your program? If M = 1, what is the running time of your program? How is the actual speed affected by the delete routine for large values of N (N > 100,000)? ps. provide a screenshot of output, thankss
There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan. c++
Imagine playing a number guessing game. A side is a number from 0 to Nhe's holding it, and the other side is trying to find that number by taking turns guessing. Number-holding side estimatehe has to offer one of the following three options in response to the party that did it:1-Your guess is correct, you found the number I kept (Game Over).2-Your estimate is wrong, but you are closer to the correct estimate than the previous estimate.3-the wrong estimate and the correct estimate are further away than the previous estimate.To find the estimated number in an environment where all the information is these, astrategy will be followed: Make a prediction (N/2) from the exact middle of N with 1 Begin:Find out the answer to your guess. [answer=answer_ogren (guess)]If the answer is equal to 1, the game is over, you can leave.If the answer is equal to 2, you are going in the right direction, keep the forecast direction;If you're heading for small numbers, the new N is now N/2.Make a guess…
[Very Hard] Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment. If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit of 4.5 dollar. For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100. Complete the RECURSIVE methods below that take an array of integers (investments) and an iterator (always…
A spinner with three equal sections is being used in a game. One section is labeled “0 points,” and two sections are labeled “2 points.” A player can decide not to spin the spinner and score 1 point. Each player gets one turn, and the player with the higher score wins; in case of a tie, the winner is decided by one flip of a fair coin. Alex takes his turn first. Eddie, knowing Alex’s score, takes his turn next. If both players use strategies that maximize their winning probabilities, what is the probability that Alex wins? a 1/3 b 1/2 c 2/3 d 4/9
: You have a basketball hoop and someone says that you can play one of two games.Game 1: You get one shot to make the hoop.Game 2: You get three shots and you have to make two of three shots.If p is the probability of making a particular shot, for which values of p should you pick one gameor the other?
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment.If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profitof 4.5 dollar.For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100.Complete the RECURSIVE methods below that take an array of integers (investments)and an iterator (always sets to ZERO(‘0’) when the…
You and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift for someone else. To see how this whole thing works, let’s consider the following example. Suppose there are 7 people A, B, C, D, E, F, and G. We denote x → y to mean “x gives a gift to y.” If the gift exchange starts with person A, then they give a gift to E. Then E gives a gift to B. And it is entirely possible that B gives a gift to A; in such a case we have completed a “cycle.” In case a cycle occurs, the gift exchange resumes with another person that hasn’t given their gift yet. If the gift exchange resumes with person D, then they give a gift to G. Then G gives a gift to F. Then F gives a gift to C. Then finally C gives a gift to D, which completes another cycle. Since all of the people have given their gifts, the giftexchange is done, otherwise the gift exchange resumes again with another person. All in all, there are two cycles that occurred during the gift exchange: A → E → B → A…
There are four possible ways to cross the river for a person. Let the first location is denoted by L1, second one is by L2, third one is by L3, and fourth one is by L4 arranged from north to south. A tiger can wait at one of the specified 4 locations. If the location chosen is same by both person and the tiger, then the payoff to the tiger is 1. If both person and tiger chosen adjacent locations the payoff to the tiger is 0.5. If both chosen location are distinct and non – adjacent then the payoffs were 0. In the present scenario, what is the value of the game to the tiger?
We examine a problem in which we are handed a collection of coins and are tasked with forming a sum of money n out of the coins. The currency numbers are coins = c1, c2,..., ck, and each coin can be used as many times as we want. What is the bare amount of money required?If the coins are the euro coins (in euros) 1,2,5,10,20,50,100,200 and n = 520, we need at least four coins. The best option is to choose coins with sums of 200+200+100+20.
Suppose we use the following KB (where x, y, z are variables and r1, r2, r3, goal are constants) to determine whether a particular robot can score. (a) Open(x) ∧ HasBall(x) → CanScore(x)(b) Open(x) ∧ CanAssist(y, x) ∧ HasBall(y) → CanScore(x) (c) PathClear(x,y) → CanAsist(x,y)(d) PathClear(x,z) ∧ CanAssist(z,y) → CanAssist(x,y) (e) PathClear(x,goal) → Open(x)(f) PathClear(y,x) → PathClear(x,y) (g) HasBall(r3)(h) PathClear(r1,goal) (i) PathClear(r2,r1) (j) PathClear(r3,r2) (k) PathClear(r3,goal)