Faculty of Health, Engineering and Science
School of Computer and Security Science
This study establishes a framework called ∗-Tego for a situation in which two agents are each given a set of players for a competitive game. Each agent places their players in an order. Players on each side at the same position in the order play one another, with the agent's score being the sum of their player's scores. The planning agents are permitted to simultaneous reorder their players in each of several stages. The reordering is termed competitive replanning. The resulting framework is scalable by changing the number of players and the complexity of the replanning process. The framework is demonstrated using iterated prisoner's dilemma on a set of twenty players. The system is first tested with one agent unable to change the order of its players, yielding an optimization problem. The system is then tested in a competitive co-evolution of planning agents. The optimization form of the system makes globally sensible assignments of players. The co-evolutionary version concentrates on matching particular high-payoff pairs of players with the agents repeatedly reversing one another's assignments, with the majority of players with smaller payoffs at risk are largely ignored.