Controlling Elections by Replacing Candidates or Votes

We consider elections where the chair replaces either candidates or votes, with the goal of making a specific candidate win (constructive control) or lose (destructive control). We call this ``replacement control'' and study its computational complexity for several scoring rules (plurality, veto, Borda, k-approval), as well as for approval voting.