Graph explorer

Greedy Galois Games

We show that two duelers with similar, lousy shooting skills (a.k.a. Galois duelers) will choose to take turns firing in accordance with the famous Thue-Morse sequence if they greedily demand their chances to fire as soon as the other's a priori probability of winning exceeds their own. This contrasts with a result from the approximation theory of complex functions that says what more patient duelers would do, if they really cared about being as fair as possible. We note a consequent interpretation of the Thue-Morse sequence in terms of certain expansions in fractional bases close to, but greater than, 1.

4 nodes3 linksoverview mapGreedy Galois Games
4 nodes3 links
Greedy Galois Games4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWGreedy Galois Gamespreprint / 2011AJoshua N. CooperResearcherAAaron M. DutleResearcherTmath.CO8936 works
PaperSignal 103 links

Greedy Galois Games

preprint / 2011

Open