A game popular in Nevada gambling casinos is Keno, which is played as follows: Twenty numbers are selected at random by the casino from the set of numbers 1 through 80. A player can select from 1 to 15 numbers; a win occurs if some fraction of the player’s chosen subset matches any of the 20 numbers drawn by the house. The payoff is a function of the number of elements in the player’s selection and the number of matches. For instance, if the player selects only I number, then he or she wins if this number is among the set of 20, and the payoff is $2.20 won for every dollar bet. (As the player’s probability of winning in this case is 1 4 , it is clear that the “fair” payoff should be $3 won for every $1 bet.) When the player selects 2 numbers, a payoff (of odds) of $12 won for every $1 bet is made when both numbers are among the 20. a. What would be the fair payoff in this case? Let p n , k , denote the probability that exactly of the n, numbers chosen by the player are among the 20 selected by the house. b. Compute p n , k c. The most typical wager at Keno consists of selecting 10 numbers. For such a bet, the casino pays off as shown in the following table. Compute the expected payoff:
A game popular in Nevada gambling casinos is Keno, which is played as follows: Twenty numbers are selected at random by the casino from the set of numbers 1 through 80. A player can select from 1 to 15 numbers; a win occurs if some fraction of the player’s chosen subset matches any of the 20 numbers drawn by the house. The payoff is a function of the number of elements in the player’s selection and the number of matches. For instance, if the player selects only I number, then he or she wins if this number is among the set of 20, and the payoff is $2.20 won for every dollar bet. (As the player’s probability of winning in this case is 1 4 , it is clear that the “fair” payoff should be $3 won for every $1 bet.) When the player selects 2 numbers, a payoff (of odds) of $12 won for every $1 bet is made when both numbers are among the 20. a. What would be the fair payoff in this case? Let p n , k , denote the probability that exactly of the n, numbers chosen by the player are among the 20 selected by the house. b. Compute p n , k c. The most typical wager at Keno consists of selecting 10 numbers. For such a bet, the casino pays off as shown in the following table. Compute the expected payoff:
Solution Summary: The author explains how to find the expected number of boxes that do not have any balls.
A game popular in Nevada gambling casinos is Keno, which is played as follows: Twenty numbers are selected at random by the casino from the set of numbers 1 through 80. A player can select from 1 to 15 numbers; a win occurs if some fraction of the player’s chosen subset matches any of the 20 numbers drawn by the house. The payoff is a function of the number of elements in the player’s selection and the number of matches. For instance, if the player selects only I number, then he or she wins if this number is among the set of 20, and the payoff is $2.20 won for every dollar bet. (As the player’s probability of winning in this case is
1
4
, it is clear that the “fair” payoff should be $3 won for every $1 bet.) When the player selects 2 numbers, a payoff (of odds) of $12 won for every $1 bet is made when both numbers are among the 20.
a. What would be the fair payoff in this case?
Let
p
n
,
k
, denote the probability that exactly of the n, numbers chosen by the player are among the 20 selected by the house.
b. Compute
p
n
,
k
c. The most typical wager at Keno consists of selecting 10 numbers. For such a bet, the casino pays off as shown in the following table. Compute the expected payoff:
When a tennis player serves, he gets two chances to serve in bounds. If he fails to do so twice, he loses the point. If he
attempts to serve an ace, he serves in bounds with probability 3/8.If he serves a lob, he serves in bounds with probability
7/8. If he serves an ace in bounds, he wins the point with probability 2/3. With an in-bounds lob, he wins the point with
probability 1/3. If the cost is '+1' for each point lost and '-1' for each point won, the problem is to determine the optimal
serving strategy to minimize the (long-run)expected average cost per point. (Hint: Let state 0 denote point over,two
serves to go on next point; and let state 1 denote one serve left.
(1). Formulate this problem as a Markov decision process by identifying the states and decisions and then finding the
Cik.
(2). Draw the corresponding state action diagram.
(3). List all possible (stationary deterministic) policies.
(4). For each policy, find the transition matrix and write an expression for the…
During each time period, a potential customer arrives at a restaurant with probability 1/2. If there are already two people
at the restaurant (including the one being served), the potential customer leaves the restaurant immediately and never
returns. However, if there is one person or less, he enters the restaurant and becomes an actual customer. The manager
has two types of service configurations available. At the beginning of each period, a decision must be made on which
configuration to use. If she uses her "slow" configuration at a cost of $3 and any customers are present during the period,
one customer will be served and leave with probability 3/5. If she uses her "fast" configuration at a cost of $9 and any
customers are present during the period, one customer will be served and leave with probability 4/5. The probability of
more than one customer arriving or more than one customer being served in a period is zero. A profit of $50 is earned
when a customer is served. The manager…
Every Saturday night a man plays poker at his home with the same group of friends. If he provides refreshments for the
group (at an expected cost of $14) on any given Saturday night, the group will begin the following Saturday night in a
good mood with probability 7/8 and in a bad mood with probability 1/8. However, if he fail to provide refreshments, the
group will begin the following Saturday night in a good mood with probability 1/8 and in a bad mood with probability
7/8 regardless of their mood this Saturday. Furthermore, if the group begins the night in a bad mood and then he fails
to provide refreshments, the group will gang up on him so that he incurs expected poker losses of $75. Under other
circumstances he averages no gain or loss on his poker play. The man wishes to find the policy regarding when to
provide refreshments that will minimize his (long-run) expected average cost per week.
(1). Formulate this problem as a Markov decision process by identifying the states and…
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY