Intransitive game

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>Hornpipe2 at 14:48, 20 June 2025 (→Examples). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

An intransitive or non-transitive game is a zero-sum game in which pairwise competitions between the strategies contain a cycle. If strategy A beats strategy B, B beats C, and C beats A, then the binary relation "to beat" is intransitive, since transitivity would require that A beat C. The terms "transitive game" or "intransitive game" are not used in game theory.

A prototypical example of an intransitive game is the game rock, paper, scissors. In probabilistic games like Penney's game, the violation of transitivity results in a more subtle way, and is often presented as a probability paradox.

Examples

See also

References

  • Script error: No such module "citation/CS1".

Script error: No such module "Navbox".

Template:Mathapplied-stub