Timeline for A (possibly boring) Voronoi Game
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2015 at 21:14 | comment | added | domotorp | In case the game is played on a graph, we have found some interesting examples here: jgaa.info/getPaper?id=331 | |
| May 10, 2015 at 13:38 | answer | added | Linus Hamilton | timeline score: 4 | |
| May 10, 2015 at 13:11 | comment | added | Joseph O'Rourke | @RupeiXu: Great references at that site, showing a 15-yr history. Thanks! | |
| May 10, 2015 at 8:00 | answer | added | Gabriel Dill | timeline score: 4 | |
| May 10, 2015 at 1:29 | comment | added | user39815 | There is the Voronoi Game Applet in this website, maybe it can be used to check your question. voronoigame.com However, usually when there are more than two players, the NE may does not exist. | |
| May 9, 2015 at 19:38 | comment | added | Joseph O'Rourke | Yes, I meant optimal = the greedy play at each step; now clarified. I was imagining $\epsilon$ very small, but now I see that eventually boundary effects must play a role. Your variation is interesting and perhaps much less boring... | |
| May 9, 2015 at 19:36 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Tried to address Yoav's point.
|
| May 9, 2015 at 19:09 | comment | added | Yoav Kallus | By optimal play do you meant the kind of greedy play you outlined or optimal in the sense of being ahead when the game ends (when the next player has no legal move)? | |
| May 9, 2015 at 19:03 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |