The Magnus-Derek game revisited

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
1 Downloads (Pure)

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 languageEnglish
Pages (from-to)38-40
JournalInformation Processing Letters
Volume109
Issue number1
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'The Magnus-Derek game revisited'. Together they form a unique fingerprint.

Cite this