Abstract
We provide a new adaptive strategy for the maximizer in the Magnus–Derek game on the n-cycle. We show that this new strategy succeeds within O(nlogn) rounds, and thus improves on a predecessor result that uses a quadratic number of rounds.
Original language | English |
---|---|
Pages (from-to) | 38-40 |
Journal | Information Processing Letters |
Volume | 109 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2008 |