Round Robin Scheduler

You are given a list of team names (strings). Your task is to create a round-robin schedule where each team plays every other team exactly once. Each round should consist of a set of matches (pairs of teams) such that no team appears in more than one match per round.

Implement a function that takes an array of team names as input and returns a schedule represented as a list of rounds. Each round should be a list of matches, and each match is a pair of team names. You can assume the number of teams is even. If the number of teams is odd, you may introduce a dummy team (e.g., 'bye') to make it even.

Example

For an input: ['A', 'B', 'C', 'D'], one valid output could be:

[
  [['A', 'D'], ['B', 'C']],
  [['A', 'C'], ['D', 'B']],
  [['A', 'B'], ['C', 'D']]
]

Your solution should efficiently generate such a schedule.