Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a228ae1bfe65610f

Jump to content

Intransitive game

From Wikipedia, the free encyclopedia

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

[edit]

See also

[edit]

References

[edit]
  • Gardner, Martin (2001). The Colossal Book of Mathematics. New York: W.W. Norton. ISBN 0-393-02023-1. Retrieved 15 March 2013.