The Team Order Problem: Maximizing the Probability of Matching Being Large Enough

TL;DR

This paper introduces a polynomial-time approximation scheme for the team order problem, optimizing match arrangements to maximize winning probability in competitive settings.

Contribution

It provides the first PTAS for the team order problem, along with tractability results for special cases and bounds on maximum weight matchings.

Findings

Developed a PTAS for the team order problem.

Established tractability results for specific cases.

Derived bounds on maximum weight matching performance.

Abstract

We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with the corresponding opposing player. The team that wins more matches wins. We consider a problem where the input is the graph of probabilities that a team 1 player can win against the team 2 player, and the output is the optimal ordering of team 1 players given the fixed ordering of team 2. Our central result is a polynomial-time approximation scheme (PTAS) to compute a matching whose winning probability is at most epsilon less than the winning probability of the optimal matching. We also provide tractability results for several special cases of the problem, as well as an analytical bound on how far the winning probability of a maximum weight matching of the underlying graph is from the best achievable winning probability.