anchor.diff:  ; SimpleVote(Deadlock)
   # ()
   ```
  -There is no fair algorithm that can decide which Game to play using these input "cycles;"
  -a result known as Arrow's Impossibility Theorem or the Condorcet Paradox.
  +There is no fair algorithm that can decide which Game to play using these input https://www.rangevoting.org/CondorcetCycles.html[cycles];
  +a result known as https://en.wikipedia.org/wiki/Arrow%27s_impossibility_theorem[Arrow's Impossibility Theorem] or the related https://en.wikipedia.org/wiki/Condorcet_paradox[Condorcet Paradox].
   Under the terms of our scenario, we have a crisis.
   These four Ents have all invested time and energy to come to the Club.
   If there is no Game, that energy will be wasted.
   Worse, the Ents may rationally decide to stop coming, and the Club will dissolve.
   Can anything be done?
   
  -We posit a new BossVote algorithm that takes Energy from one Ent to establish their vote as the "default" choice, to ensure that the Club can always decide on a Game to play
  +We posit a new `BossVote` algorithm that takes Energy from one Ent to establish their vote as the "default" choice, to ensure that the Club can always decide on a Game to play
   ```
   ; .Boss Club.0 # Choose member 0 of the Club as Boss
   ; BossVote(Boss, Deadlock) # Re-run the vote using energy from that Boss
  
positive.code:    0,
  ]
  
  .MartyBoss_Game [
    [.E -11, (.I -1, .C 10)],
    [.E -5,  (.I  1, .C 10)],
    [.E -5,  (.I  2, .C 10)],
  
negative.code: . The 'ignored' member has a 'skewed' Generativity result `(.I -1, .C 10)`; this outcome is only worthwhile to them if 10 units gained of Connecting justify the 1 unit lost to Individuating, or if there are external considerations that sway the balance
  . This analysis feels very different if we ignore Energy, because then it would seem the Boss is getting something for nothing
  
  For completeness, we can add the "Martyr-Boss" who proposes their least-favorite Game (`.D`) in order to keep the peace:
  ```
  .DeIndividuating_Impact [
    -3,
  