Timeline for The weak limit of a sequence of argmax functions
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 25, 2023 at 17:08 | vote | accept | Saito | ||
| Nov 25, 2023 at 8:19 | answer | added | Pietro Majer | timeline score: 1 | |
| Nov 25, 2023 at 7:50 | answer | added | Christophe Leuridan | timeline score: 2 | |
| Nov 24, 2023 at 12:21 | history | edited | Saito | CC BY-SA 4.0 |
added 30 characters in body
|
| Nov 24, 2023 at 12:18 | comment | added | Saito | Sorry for many mistakes. $A$ is a compact subset of $\mathbf{R}^n.$ For $\mathrm{argmax},$ you are right; $U_i(g(i), \sigma) = \mathrm{max}_{a\in A} U_i(a, \sigma)$ and the same for $\sigma_n.$ I will edit may post. | |
| Nov 24, 2023 at 12:02 | comment | added | Christophe Leuridan | $A$ is a compact subset of what? And what does $\arg\max$ mean when the maximum is multiply achieved? Should not you write simply $U_i(g(i),\sigma) = \max_{a \in A} U_i(a,\sigma)$ and the same for $\sigma_n$ ? | |
| Nov 24, 2023 at 11:34 | history | asked | Saito | CC BY-SA 4.0 |