mixed strategy

(redirected from Mixed strategies)

mixed strategy

[¦mikst ′strad·ə·jē]
(mathematics)
A method of playing a matrix game in which the player attaches a probability weight to each of the possible options, the probability weights being nonnegative numbers whose sum is unity, and then operates a chance device that chooses among the options with probabilities equal to the corresponding weights.
(statistics)
A concept in game theory which allows a player more than one choice of action which is determined by a chance mechanism.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
"One of the strongest suits of the bot is the ability to play mixed strategies. It can have the exact same hand and the same scenario and bet differently every time," professional poker player Darren Elias, who participated in the experiment, told The Washington Post.
Only the case of mixed strategies will be discussed here, for the pure strategy cases are very similar to the ones presented with regard to the patient-doctor relationship.
For the full disclosure policy (D, D, D), the (unique) equilibrium mixed strategies are as follows:
Since probabilities are continuous, there are infinite mixed strategies available to a player.
That is, we have concentrated on the defect probabilities that arise from the mixed strategies of either the managers or the employees to contain the shading incentives of the other group of DMs.
Caption: Figure 5: Equilibrium mixed strategies for the partially observable case when R = 5, [[mu].sub.1] = 2, and [[mu].sub.0] = 0.5.
Mixed strategies in game theory models have been used to model various types of competitive behavior, such as the bidding in an auction, tax cheating and auditing, and terrorist strikes and prevention.
More precisely, using mixed strategies means that the channel assignment of cluster head i is the outcome of a probabilistic experiment based on the probability vector [p.sub.i] (imagine that each SU rolls a biased dice in each strategy update).
5 6 3 4 4 3 2 7 4 2 5 3 We build linear programming problems of maximum and minimum to determine the optimal mixed strategies of the two players.
The above means that in each finished two-person game, there is a pair of optimum mixed strategies (p*, q*) representing the saddle point of game [GAMMA]m.
Moreover, for both the LDistance and the mixed strategies, we find that the impact of clustering strength [lambda] on the average delivering time [T.sub.ave] is not so obvious.