Search results
Jump to navigation
Jump to search
- ...title=Combinatorial Game Theory |date=20 November 2023 |publisher=American Mathematical Society |isbn=978-1-4704-7568-0}}</ref> * [[Octal games]] ...993 bytes (144 words) - 06:40, 3 February 2025
- ...with Application to Nash Equilibrium Points. ''Proceedings of the American Mathematical Society,'' 3(1), pp. 170-174, https://doi.org/10.2307/2032478</ref> ...| last2 = Wolfe | pages = 299–306 | title = Contributions to the Theory of Games III | editor1-first = M. | editor1-last = Dresher | editor2-first = A. W. | ...2 KB (245 words) - 16:01, 11 September 2023
- ...ing for the [[fair division]] of the costs among the users. The irrigation games are mentioned first by [[#Aadland|Aadland and Kolpin 1998]], but the forma == Mathematical definition == ...5 KB (776 words) - 16:09, 3 December 2024
- In words, payoff functions in aggregative games depend on players' ''own strategies'' and the ''aggregate'' <math>\sum s_j< ...ings on Decision and Control|volume=49|pages=3133–3139}}</ref> Aggregative games with a continuum of players are frequently studied in [[mean field game the ...6 KB (889 words) - 23:49, 15 August 2023
- == Mathematical description == == Example games== ...5 KB (694 words) - 14:39, 24 July 2024
- ...-known games such as [[Nim]] and [[Chomp]].<ref name="MSCW2011" /> In such games, two players start with a [[poset]] (a '''partially ordered set'''), and ta ...e game play in a game of [[Nim]] with a heap of size |''P''|. For, in both games, it is possible to choose a move that leads to a game of the same type whos ...5 KB (901 words) - 05:21, 7 October 2024
- {{Short description|Class of mathematical game}} ...ctal games''' are a [[Subclass_(set_theory)|subclass]] of [[heap game|heap games]] that involve removing tokens (game pieces or stones) from heaps of tokens ...9 KB (1,448 words) - 20:51, 11 February 2025
- In the mathematical [[game theory|theory of games]], in particular the study of [[zero-sum]] [[continuous game]]s, not every ...| last2 = Wolfe | pages = 299–306 | title = Contributions to the Theory of Games III | editor1-first = M. | editor1-last = Dresher | editor2-first = A. W. | ...5 KB (801 words) - 17:00, 9 September 2022
- {{Short description|Mathematical criterion in game theory}} ==Max-solvable games== ...7 KB (1,235 words) - 19:03, 28 March 2023
- ...|first1=Roger |author1-link=Roger Myerson |title=Graphs and Cooperation in Games |journal=Mathematics of Operations Research |date=1977 |volume=2 |issue=3 | === Cooperative games === ...7 KB (1,172 words) - 07:21, 17 February 2025
- ...his distinguishes them from turn-based games ([[Sequential game|sequential games]]) like chess, focusing instead on real-time strategic conflicts. ...9781611971132}}</ref> While the two overlap significantly, continuous-time games also encompass models not governed by differential equations, such as those ...10 KB (1,311 words) - 20:59, 20 February 2025
- ===Mathematical limerick=== The following [[mathematical joke|mathematical limerick]] is attributed to him:<ref>{{cite web |url=http://www.lockhaven.e ...2 KB (207 words) - 15:11, 16 August 2023
- ...last3=Strobel |first3=Martin |title=Efficient Coordination in Weakest-Link Games |url=https://excen.gsu.edu/docs/MinimumEffortGame_prelversion.pdf |journal= ...mes-09-00042/article_deploy/games-09-00042.pdf?version=1530270291 |journal=Games |publisher=[[MDPI]] |volume=9 |issue=3 |date=9 June 2018 |issn=2073-4336 |d ...3 KB (509 words) - 00:39, 2 February 2025
- | title=Winning Ways for Your Mathematical Plays, Vol. I ...ory)|overheating]], an operation for analyzing the theory of combinatorial games, and used Blockbusting as an example for that operation.<ref name=b87/> ...4 KB (516 words) - 05:35, 30 June 2024
- ===Mathematical analysis=== ...allowed.<ref name="eppstein">{{Cite web |title=Computational Complexity of Games and Puzzles |url=https://ics.uci.edu/~eppstein/cgt/hard.html |access-date=2 ...9 KB (1,339 words) - 02:08, 27 February 2025
- ...on Games]] | publisher=[[Mathematical Programming ]] | year=1975 | journal=Mathematical Programming | volume=9 | pages=358–370 | doi=10.1007/BF01681356}} [[Category:Cooperative games]] ...3 KB (434 words) - 18:42, 25 July 2020
- {{Short description|Generalization of games used in game theory}} ...from a finite set of pure strategies. The continuous game concepts allows games to include more general sets of pure strategies, which may be [[uncountable ...10 KB (1,619 words) - 19:02, 5 August 2024
- In the specific case of misere-play impartial games, such commutative monoids have become known as '''misere quotients'''. | title = Nim, a game with a complete mathematical theory ...8 KB (1,288 words) - 14:31, 24 July 2024
- {{Short description|Mathematical game}} ...adjacent pins, until all the pins are gone. Using the notation of [[octal games]], Kayles is denoted '''0.77'''. ...7 KB (1,033 words) - 05:43, 6 April 2024
- {{Short description|Operations adjusting incentives of combinatorial games}} | title=Winning Ways for Your Mathematical Plays ...7 KB (1,017 words) - 22:29, 6 February 2023