A rectangular array of mn numbers arranged in n rows, each consisting of m columns, is said to contain a saddlepoint if there is a number that is both the minimum of its row and the maximum of its column. For instance, in the array 1 3 2 0 − 2 6 .5 12 3 the number 1 in the first row, first column is a saddlepoint. The existence of a saddlepoint is of significance in the theory of games. Consider a rectangular array of numbers as described previously and suppose that there are two individuals— A and B—who are playing the following game: 4 is to choose one of the numbers 1, 2,. .., n and B one of the numbers 1, 2,. . ., m. These choices are announced simultaneously, and if A chose i and B chose j. then A wins from B the amount specified by the number in the i th row, j th column of the array. Now suppose that the array contains a saddle point—say the number in the row r and column k call this number x r k . Now if player A chooses row r, then that player can guarantee herself a win of at least x r k (since x r k is the minimum number in the row r). On the other hand, if player B chooses column k, then he can guarantee that he will lose no more than x r k (since x r k is the maximum number in the column k). Hence, as A has a way of playing that guarantees her a win of x r k and as B has a way of playing that guarantees he will lose no more than x r k it seems reasonable to take these two strategies as being optimal and declare that the value of the game to player A is x r k . If the nm numbers in the rectangular array described are independently chosen from an arbitrary continuous distribution, what is the probability that the resulting array will contain a saddlepoint?
A rectangular array of mn numbers arranged in n rows, each consisting of m columns, is said to contain a saddlepoint if there is a number that is both the minimum of its row and the maximum of its column. For instance, in the array 1 3 2 0 − 2 6 .5 12 3 the number 1 in the first row, first column is a saddlepoint. The existence of a saddlepoint is of significance in the theory of games. Consider a rectangular array of numbers as described previously and suppose that there are two individuals— A and B—who are playing the following game: 4 is to choose one of the numbers 1, 2,. .., n and B one of the numbers 1, 2,. . ., m. These choices are announced simultaneously, and if A chose i and B chose j. then A wins from B the amount specified by the number in the i th row, j th column of the array. Now suppose that the array contains a saddle point—say the number in the row r and column k call this number x r k . Now if player A chooses row r, then that player can guarantee herself a win of at least x r k (since x r k is the minimum number in the row r). On the other hand, if player B chooses column k, then he can guarantee that he will lose no more than x r k (since x r k is the maximum number in the column k). Hence, as A has a way of playing that guarantees her a win of x r k and as B has a way of playing that guarantees he will lose no more than x r k it seems reasonable to take these two strategies as being optimal and declare that the value of the game to player A is x r k . If the nm numbers in the rectangular array described are independently chosen from an arbitrary continuous distribution, what is the probability that the resulting array will contain a saddlepoint?
Solution Summary: The author explains how the probability of a saddle point in an array of size n is calculated by using the following expression:
A rectangular array of mn numbers arranged in n rows, each consisting of m columns, is said to contain a saddlepoint if there is a number that is both the minimum of its row and the maximum of its column. For instance, in the array
1
3
2
0
−
2
6
.5
12
3
the number 1 in the first row, first column is a saddlepoint. The existence of a saddlepoint is of significance in the theory of games. Consider a rectangular array of numbers as described previously and suppose that there are two individuals— A and B—who are playing the following game: 4 is to choose one of the numbers 1, 2,. .., n and B one of the numbers 1, 2,. . ., m. These choices are announced simultaneously, and if A chose i and B chose j. then A wins from B the amount specified by the number in the
ith row, jth column of the array. Now suppose that the array contains a saddle point—say the number in the row r and column k call this number
x
r
k
. Now if player A chooses row r, then that player can guarantee herself a win of at least
x
r
k
(since
x
r
k
is the minimum number in the row r). On the other hand, if player B chooses column k, then he can guarantee that he will lose no more than
x
r
k
(since
x
r
k
is the maximum number in the column k). Hence, as A has a way of playing that guarantees her a win of
x
r
k
and as B has a way of playing that guarantees he will lose no more than
x
r
k
it seems reasonable to take these two strategies as being optimal and declare that the value of the game to player A is
x
r
k
. If the nm numbers in the rectangular array described are independently chosen from an arbitrary continuous distribution, what is the probability that the resulting array will contain a saddlepoint?
3. A different 7-Eleven has a bank of slurpee fountain heads. Their available flavors are as follows: Mountain
Dew, Mountain Dew Code Red, Grape, Pepsi and Mountain Dew Livewire. You fill five different cups full
with each type of flavor. How many different ways can you arrange the cups in a line if exactly two Mountain
Dew flavors are next to each other?
3.2.1
Answer questions 8.3.3 and 8.3.4 respectively
8.3.4 .WP An article in Medicine and Science in Sports and
Exercise [“Electrostimulation Training Effects on the Physical Performance of Ice Hockey Players” (2005, Vol. 37, pp.
455–460)] considered the use of electromyostimulation (EMS) as
a method to train healthy skeletal muscle. EMS sessions consisted of 30 contractions (4-second duration, 85 Hz) and were carried
out three times per week for 3 weeks on 17 ice hockey players.
The 10-meter skating performance test showed a standard deviation of 0.09 seconds. Construct a 95% confidence interval of the
standard deviation of the skating performance test.
8.6.7 Consider the tire-testing data in Exercise 8.2.3. Compute a 95% tolerance interval on the life of the tires that has confidence level 95%. Compare the length of the tolerance interval with the length of the 95% CI on the population mean. Which interval is shorter? Discuss the difference in interpretation of these two intervals.
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.
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Big Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt
