Category:Maximin Strategies

From ProofWiki
Jump to navigation Jump to search

This category contains results about Maximin Strategies.
Definitions specific to this category can be found in Definitions/Maximin Strategies.

Let $G$ be a two-person game between players $A$ and $B$.

A maximin strategy for $A$ is one in which:

$(1): \quad A$ assumes that $B$ will make that move which makes $A$'s payoff (or average payoff, in the case of a random element) as small as possible.
$(2): \quad A$ then makes the move which makes this smallest gain the largest possible.

Hence it is the strategy that will maximise $A$'s minimum payoff.

This category currently contains no pages or media.