This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:
Game theory Low‑importance This article is part of WikiProject Game theory, an attempt to improve, grow, and standardize Wikipedia's articles related to Game theory. We need your help! Join in | Fix a red link | Add content | Weigh inGame theoryWikipedia:WikiProject Game theoryTemplate:WikiProject Game theorygame theory Low This article has been rated as Low-importance on the importance scale.

But to where, I don't know. --124.106.231.91 (talk) 13:08, 10 November 2008 (UTC)[reply]

In the figure legend, the sentence :

"The payoff is 0.5 along the two diagonal lines"

should probably read :

"The payoff is 0.0 along the two diagonal lines" — Preceding unsigned comment added by 94.67.176.244 (talk) 14:42, 18 January 2015 (UTC)[reply]

Right. I confirmed that it needs to be 0 to be consistent with the stated bounds, and fixed the caption. Joule36e5 (talk) 21:34, 25 September 2015 (UTC)[reply]

I have a possible simpler example. Both players choose a number in (0, 1]. The payoff for player 1 is 1 if their number is smaller, 0 if equal, and -1 if smaller. Then sup inf equals -1, and inf sup equals 1. Both players want to choose the smaller number, and if one player knows the other's PDF, then they undercut with a pure strategy x, which is positive. This can be shown using similar arguments as in the article. Mainly, for any PDF f on (0, 1], then the weight on [x, 1] has limit 1 as x -> 0, so there exists a positive number x with P(sample from f > x) > 0.99. It may be possible to add 0 to the choice set of both players and maintain a positive value gap, but I did not do that. 38.73.247.37 (talk) 21:49, 20 May 2022 (UTC)[reply]

Is this better named a "game without a minimax value"? If this is not what sort of value does this game not have. This article wrongly ignores this term for which the the article is named. tahc ^chat 20:47, 13 May 2023 (UTC)[reply]