Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with game-theory
Search options not deleted
user 43954
2
votes
Higher or lower?
Let $\mathcal W^*$ be the set of all words (including the empty word $E$) over the alphabet $\{L,H\}$. For
each $w\in \mathcal W^*$ let $|w|$ be length of the word $w$. For each $w\in \mathcal W^*$, n …
- 5,409
3
votes
Mutual metric projection
I started to investigate properties of possible required map $S$, but they are hard to grasp,
so my vision of them is very coarse, see the propositions below.
But I shall try to use them to refine des …
- 5,409