Timeline for A competitive root finding game
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 8, 2013 at 23:01 | vote | accept | Aaron Meyerowitz | ||
| Oct 11, 2011 at 6:13 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Oct 8, 2011 at 9:57 | answer | added | Chad Musick | timeline score: 2 | |
| Oct 8, 2011 at 7:39 | comment | added | Aaron Meyerowitz | I suppose one could discretize and say that the selected x and y are irrational but the guesses must be $\frac{n}{2^{100}}$ or something like that. | |
| Oct 8, 2011 at 6:11 | comment | added | Will Sawin | There is certainly not a pure strategy equilibrium, owing to the discrete jumps in payoffs for small changes in interval size. Do X and Y know the length of the other one's interval? If not, then you could just have both players choose a partition into 2^k. If so, then one would want to define an optimal strategy dependent on the time left and the ratio between the partitions. Doing so would handily answer your second question. However, it sounds quite difficult. | |
| Oct 8, 2011 at 5:59 | history | asked | Aaron Meyerowitz | CC BY-SA 3.0 |