Search results
Jump to navigation
Jump to search
Page title matches
- ...]]. CGT arose in relation to the theory of impartial games, the two-player game of [[Nim]] in particular, with an emphasis on "solving" certain types of co A game must meet several [[conditions]] to be a combinatorial game. These are: ...6 KB (1,097 words) - 23:35, 19 September 2015
Page text matches
- ...]]. CGT arose in relation to the theory of impartial games, the two-player game of [[Nim]] in particular, with an emphasis on "solving" certain types of co A game must meet several [[conditions]] to be a combinatorial game. These are: ...6 KB (1,097 words) - 23:35, 19 September 2015
- ...em; <br> label cover game; parallel repetition theorem; unique label cover game; the unique games conjecture (UGC); <br> Boolean function; Fourier transfor |align="center"|陈嘉|| Algorithmic Game Theory.<br>Strategic games; mechanism design; combinatorial auction; Vickrey aucti ...4 KB (455 words) - 07:53, 28 December 2011
- ...n a head, you will win <math>2^k</math> dollars as the reward. Despite the game's expected reward being infinite, people tend to offer relatively modest am ...\log_2 n} \overset{P}{\to} 1</math>. (Therefore, a fair price to play this game <math>n</math> times is roughly <math>n \log_2 n</math> dollars) ...13 KB (2,150 words) - 08:49, 7 June 2023
- ...re the challenges that arise at the interface of machine learning and game theory: selfish agents may interact with machine learning algorithms strategically ...on of "fairness" in real-world applications and how to model "fairness" in theory. Then I will present several recent progress in designing algorithms that m ...12 KB (1,731 words) - 06:09, 29 April 2019
- ...f we calculate mutual information for weather and another value for a card game, the two values cannot easily be compared. * [[Information theory]] ...3 KB (561 words) - 16:37, 28 September 2016
- ...[[Abstract algebra]] || [[Linear algebra]] || [[Order theory]] || [[Graph theory]] ...l equation]]s || [[Dynamical systems theory|Dynamical systems]] || [[Chaos theory]] ...9 KB (1,088 words) - 18:04, 22 August 2017
- ...he problem and an output is called a '''solution''' to that instance. The theory of complexity deals almost exclusively with [http://en.wikipedia.org/wiki/D ...cap</math> co-'''NP'''? It is an important open problem in the complexity theory which is closely related to our understanding of the relation between '''NP ...25 KB (4,263 words) - 08:43, 7 June 2010
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...19 KB (3,458 words) - 06:51, 12 October 2015
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...19 KB (3,458 words) - 06:18, 20 March 2013
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...19 KB (3,458 words) - 07:33, 12 March 2014
- ...rs]. Practice square numbers up to 144 with this children's multiplication game [[Category:Number theory]] ...7 KB (1,032 words) - 07:35, 22 June 2017
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 09:51, 19 March 2024
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 07:00, 29 September 2016
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 16:07, 12 March 2025
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 11:45, 15 October 2017
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 06:15, 30 September 2019
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 12:45, 16 March 2023
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,227 words) - 17:21, 30 March 2026
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...29 KB (5,077 words) - 04:54, 7 October 2010
- We introduce a general theory of counting permutations with restricted positions. In the derangement prob It is traditionally described using terminology from the game of chess. Let <math>B\subseteq \{1,\ldots,n\}\times \{1,\ldots,n\}</math>, ...33 KB (6,205 words) - 01:11, 22 September 2011