Timeline for How to win this dice probability game?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11 at 12:38 | history | edited | User1865345 |
edited tags
|
|
| Nov 10 at 19:16 | answer | added | Sextus Empiricus | timeline score: 0 | |
| Nov 10 at 18:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 25, 2019 at 10:19 | comment | added | Neil Slater | Actually with 20 players this could be beyond DP, and require an approximate answer. Also policies that simply maximise your expected score are likely to be reasonable first order estimates. | |
| Sep 25, 2019 at 10:17 | comment | added | Neil Slater | This can be solved using combination of Dynamic Programming and Game Theory. You need Game Theory under the assumption that you can see all the other players, and know their current scores plus value in the bank. Policies that maximise your expected final permanent score will be subtly different from policies that beat all other current players - e.g. you will be incentivised to sit down earlier once in the lead, because other players are forced to take more risk. | |
| Sep 25, 2019 at 10:00 | answer | added | user2974951 | timeline score: 1 | |
| Sep 24, 2019 at 21:00 | history | tweeted | twitter.com/StackStats/status/1176602329841356801 | ||
| Sep 24, 2019 at 19:37 | answer | added | MikeP | timeline score: 2 | |
| Sep 24, 2019 at 13:58 | comment | added | Glen_b | Just to be sure I understand correctly, players who sat down all stand up again once the scores reset? | |
| Sep 24, 2019 at 13:49 | history | edited | DrBillyBob | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Sep 24, 2019 at 13:30 | review | First posts | |||
| Sep 24, 2019 at 13:36 | |||||
| Sep 24, 2019 at 13:29 | history | asked | DrBillyBob | CC BY-SA 4.0 |