An O(n)-round strategy for the Magnus-Derek game

DOI10.3390/A3030244MaRDI QIDQ1662552zbMATHOpenAlexFDO

Authors Zhivko Nedev

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/a3030244

zbMATH Keywords

combinatorial gamesalgorithmic game theoryadditive combinatorics

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40) 2-person games (91A05) Combinatorial games (91A46)

Recommendations

• More on the Magnus-Derek game
• The Magnus-Derek game
• The Magnus-Derek game in groups
• The c game revisited
• Domination game on paths and cycles

Cites work

• An algorithm for finding a nearly minimal balanced set in \(\mathbb{F}_p\)
• BALANCED SETS AND THE VECTOR GAME
• On the Addition of Residue Classes
• The Magnus-Derek game
• The On-Line Encyclopedia of Integer Sequences
• The c game revisited
• Universal sets and the vector game

Cited in

(7)

• The explorer-director game on graphs
• The Magnus-Derek game in groups
• More on the Magnus-Derek game
• Lower bound for balanced sets
• The Magnus-Derek game
• Palindromes in finite groups and the explorer-director game
• The c game revisited

This page was built for publication: An \(O(n)\)-round strategy for the Magnus-Derek game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662552)