Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • {{Short description|Type of sequential game}} ...nal game''' (also called '''Maker-Maker game''') is a kind of [[positional game]].<ref name=":0">{{Cite Positional Games 2014}}</ref>{{Rp|9–12}} Like most ...
    5 KB (755 words) - 13:35, 14 April 2024
  • ...aphical form is an [[Succinct game|alternate compact representation]] of a game using the interaction among participants. Consider a game with <math>n</math> players with <math>m</math> strategies each. We will re ...
    3 KB (457 words) - 02:09, 10 February 2025
  • ...of a [[repeated game]]: a repeated game is a special case of a multi-stage game, in which the stage games are identical. == Multi-Stage Game with Different Information Sets == ...
    3 KB (440 words) - 15:18, 17 December 2021
  • {{Short description|Generalization of the game Tic-tac-toe to higher dimensions}} {{DISPLAYTITLE:''n<sup>d</sup>'' game}} ...
    4 KB (536 words) - 04:42, 4 April 2024
  • {{Short description|Mathematical criterion in game theory}} ...ed strategy''' is a [[strategy]] which is not a [[best response]] to any [[strategy profile]] of the other players. This is an extension to the notion of [[dom ...
    7 KB (1,235 words) - 19:03, 28 March 2023
  • {{Short description|Concept in game theory}} ...function|continuity]] that finds application in the study of [[continuous game]]s. ...
    2 KB (391 words) - 23:38, 28 January 2023
  • ...ames''' are [[mathematical game|mathematical]] [[game of strategy|games of strategy]], generalizing many well-known games such as [[Nim]] and [[Chomp]].<ref na A poset game on ''P'', played between two players conventionally named [[Alice and Bob]] ...
    5 KB (901 words) - 05:21, 7 October 2024
  • {{short description|Topological game}} ...nguage=en}}</ref> A closely related game is known as the '''strong Choquet game'''. ...
    3 KB (566 words) - 22:03, 12 February 2025
  • In the study of [[zero sum]] [[game theory|games]], '''Glicksberg's theorem''' (also '''Glicksberg's existence theorem ...ame]]. If the [[payoff function]] ''K'' is upper semicontinuous, then the game has a value. ...
    2 KB (245 words) - 16:01, 11 September 2023
  • {{Short description|Metric to measure distances between strategies in game theory}} In [[game theory]], the '''Helly metric''' is used to assess the distance between two [[Stra ...
    3 KB (493 words) - 01:49, 27 August 2024
  • ...measure]] (in other words, one of the players is forbidden to use a [[pure strategy]]). ...t loss of generality|WLOG]] <math>Y</math>) is forbidden from using a pure strategy. ...
    3 KB (458 words) - 20:40, 6 December 2024
  • ...value.svg|thumb|240px|Game square (that is, the payoff to player I) for a game with no value, due to Sion and Wolfe. The payoff is 0 along the two diagon ...s is the [[expected value]] to one of the players when both play a perfect strategy (which is to choose from a particular [[probability density function|PDF]]) ...
    5 KB (801 words) - 17:00, 9 September 2022
  • {{short description| A combinatorial game solved using overheating }} ...-09-01|title=Blockbusting and domineering|journal=Journal of Combinatorial Theory, Series A|language=en|volume=49|issue=1|pages=67–116|doi=10.1016/0097-3165( ...
    4 KB (516 words) - 05:35, 30 June 2024
  • ...me comes from the fact that the [[Normal-form game|normal form]] of such a game can be described by two [[Matrix (mathematics)|matrices]] - matrix <math>A< ...at: <math display="inline">\sum_{i=1}^m x_i = 1</math>. Similarly, a mixed strategy for the column player is a non-negative vector <math>y</math> of length <ma ...
    3 KB (529 words) - 21:24, 4 July 2023
  • {{Short description|Game theory concept}} ...is a game in which every player’s payoff is a function of the player’s own strategy and the aggregate of all players’ strategies. The concept was first propose ...
    6 KB (889 words) - 23:49, 15 August 2023
  • {{Short description|Kind of positional game}} A '''discrepancy game''' is a kind of [[positional game]]. Like most positional games, it is described by its set of ''positions/po ...
    4 KB (593 words) - 21:58, 14 October 2024
  • ...in the standard game each player picks one element per turn, in the biased game each player takes a different number of elements. ...every two positive integers ''p'' and ''q'', a (p:q)-positional game is a game in which the first player picks ''p'' elements per turn and the second play ...
    7 KB (1,056 words) - 00:24, 4 January 2023
  • {{short description|Positional game}} ...layers alternately pick edges, trying to occupy a complete [[Clique (graph theory)|clique]] of a given size. ...
    4 KB (675 words) - 02:50, 2 February 2024
  • ...f>{{Cite book|url=https://books.google.com/books?id=Nkzbkj-c83YC|title=Set Theory: On the Structure of the Real Line|last1=Bartoszynski|first1=Tomek|last2=Ju === Topological game characterization === ...
    4 KB (706 words) - 20:22, 1 July 2023
  • {{Short description|Type of two player combinatorial game}} ...14">{{Cite Positional Games 2014}}</ref>''' is a kind of a [[combinatorial game]] for two players. It is described by: ...
    6 KB (940 words) - 14:32, 26 November 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)