Social Golfer Problem: Designs & Algorithms

• The Social Golfer Problem is a combinatorial scheduling challenge that groups golfers into rounds with constraints to prevent repeat pairings.
• Its formulations span design theory, graph theory, and tournament scheduling, leveraging RBIBD, RGDD, and greedy online methods to maximize rounds.
• Recent studies employ SAT encodings and approximation algorithms to address symmetry breaking and enhance scheduling efficiency.

Searching arXiv for recent and foundational papers on the Social Golfer Problem. The Social Golfer Problem (SGP) is the problem of scheduling $q=g\cdot p$ golfers over $w$ weeks so that, in each week, the golfers are partitioned into $g$ groups of size $p$, every golfer plays exactly once per week, and no pair of golfers plays together more than once over the whole schedule (Lardeux et al., 2014). In combinatorial-design terminology, the same problem is written as $\text{SGP}(v,k,r)$, where $v=k\cdot n$ points are arranged into $r$ rounds of $n$ non-intersecting blocks of size $k$, again with the condition that any two points are assigned to the same block at most once (Miller et al., 31 Jul 2025). Recent work places this classical offline design problem alongside a distinct greedy or online variant in which rounds are chosen one by one with no preplanning and no revision of earlier rounds, yielding a sharp worst-case lower bound on how many rounds can always be guaranteed (Schmand et al., 2020).

1. Formal definitions and equivalent representations

Three parameterizations recur in the literature. In the scheduling formulation, an instance is given by a triple $g$-$w$0-$w$1, with $w$2 total golfers, $w$3 groups per week, $w$4 golfers in each group, and $w$5 weeks (Lardeux et al., 2014). In the graph-theoretic and tournament-scheduling formulation, $w$6 denotes the number of players, $w$7 the group size, and one round is a partition of all $w$8 players into $w$9 groups of size $g$0, under the constraint that no pair of players meets more than once (Schmand et al., 2020). In the design-theoretic formulation, $g$1 consists of arranging $g$2 points into $g$3 rounds of $g$4 non-intersecting blocks of size $g$5 such that two points are assigned to the same block at most once (Miller et al., 31 Jul 2025).

These formulations are equivalent at the level of incidence structure. The set-constraint model writes group variables $g$6, where $g$7 is the week and $g$8 is the group number, with the core conditions

$g$9

and

$p$0

The disjointness condition

$p$1

is explicitly stated to be implied by (9) and (10), and therefore unnecessary in that model (Lardeux et al., 2014).

The graph-theoretic formulation replaces players by vertices of $p$2, groups of size $p$3 by copies of $p$4, and a round by a $p$5-factor, that is, $p$6 vertex-disjoint copies of $p$7 covering all vertices (Schmand et al., 2020). After a round is played, the edges inside those $p$8’s are deleted from the feasibility graph. Equivalently, if $p$9 is a tournament with $\text{SGP}(v,k,r)$0, then the feasibility graph after rounds $\text{SGP}(v,k,r)$1 is

$\text{SGP}(v,k,r)$2

A next round is feasible if and only if $\text{SGP}(v,k,r)$3 still contains a $\text{SGP}(v,k,r)$4-factor (Schmand et al., 2020).

A central quantitative restriction is the pair-count or point-degree bound. Since each point meets $\text{SGP}(v,k,r)$5 others in each round and no pair may be repeated, the number of rounds satisfies

$\text{SGP}(v,k,r)$6

which is later denoted

$\text{SGP}(v,k,r)$7

If a schedule attains this bound, it is maximal (Miller et al., 31 Jul 2025). This upper bound also appears in the algorithmic literature as

$\text{SGP}(v,k,r)$8

for the maximum possible number of rounds in the classical offline SGP maximization problem (Schmand et al., 2020).

2. Classical offline SGP and its design-theoretic structure

In the classical offline setting, all rounds are designed jointly. The design-theoretic interpretation is that SGP schedules are resolvable packings, and when every pair occurs exactly once they are resolvable block designs (Miller et al., 31 Jul 2025). In particular, an RBIBD$\text{SGP}(v,k,r)$9 gives a schedule in which every pair of points occurs exactly once, and because the blocks resolve into parallel classes, each parallel class is a round. Such a design yields exactly

$v=k\cdot n$0

rounds, matching the upper bound, and is therefore maximal (Miller et al., 31 Jul 2025).

A resolvable group divisible design also yields SGP schedules, but with a different incidence pattern. A $v=k\cdot n$1-RGDD on $v=k\cdot n$2 points with group size $v=k\cdot n$3 gives

$v=k\cdot n$4

rounds, because each point meets all points outside its own group exactly once (Miller et al., 31 Jul 2025). This explains an important distinction between two types of complete-looking schedules. In an RBIBD-derived schedule, every pair appears exactly once. In an RGDD-derived schedule, some pairs never occur because pairs within a design-group are never scheduled together (Miller et al., 31 Jul 2025).

The literature distinguishes carefully between optimal and maximal. A solution with $v=k\cdot n$5 rounds is called optimal if no solution with more than $v=k\cdot n$6 rounds is known, whereas it is maximal if no solution with more than $v=k\cdot n$7 rounds is possible (Miller et al., 31 Jul 2025). This distinction matters because many constructions for larger block sizes are presented as best-known schedules rather than as schedules certified to meet the absolute upper bound.

A common misconception is to identify any strong constructive schedule with a maximal one. The design literature separates these notions explicitly. For example, for $v=k\cdot n$8, a URD fallback can yield an optimal schedule with $v=k\cdot n$9 rounds in exceptional cases, while maximality would require $r$0 rounds (Miller et al., 31 Jul 2025). This suggests that construction quality and extremal optimality should be distinguished even when the gap is only one round.

3. Constructive families and existence results

Resolvable combinatorial designs supply the strongest known exact constructions for many parameter ranges (Miller et al., 31 Jul 2025). For block size $r$1, the paper states that maximal allocations exist for all $r$2 via Kirkman triple systems, and for all $r$3, $r$4, via nearly Kirkman triple systems, which are $r$5-RGDDs of type $r$6 (Miller et al., 31 Jul 2025). The small exceptions are handled separately: for $r$7, one round of two blocks; for $r$8, RTD$r$9 (Miller et al., 31 Jul 2025).

For block size $n$0, the construction theory is nearly complete. If $n$1, an RBIBD$n$2 gives $n$3 rounds and is maximal. If $n$4, a $n$5-RGDD of type $n$6 gives $n$7 rounds, equal to $n$8, and is therefore maximal. If $n$9, a $k$0-RGDD of type $k$1 gives $k$2 rounds, also maximal when it exists. For the larger exceptional values, the cited work uses a URD$k$3 with

$k$4

and the $k$5-block rounds form an optimal schedule one short of maximal (Miller et al., 31 Jul 2025).

For $k$6, the situation is weaker. If $k$7 and RBIBD$k$8 exists, then one obtains a maximal allocation with $k$9 rounds; existence is stated except for

$g$0

Outside this RBIBD range, the paper often uses RTD$g$1, giving $g$2 rounds, together with several special cases such as URD$g$3 with $g$4, an incomplete group divisible design for $g$5 with $g$6 rounds, and an analogous design for $g$7 with $g$8 rounds (Miller et al., 31 Jul 2025).

Two further constructive mechanisms broaden the available range. First, if there exist $g$9 MOLS$w$00 with $w$01, then the Sharma–Das construction gives a $w$02-round $w$03 allocation, and if $w$04, the unused cliques contribute extra rounds, yielding

$w$05

Second, the starter-block construction denoted $w$06 develops modular starter blocks into parallel rounds, with unused pairs forming $w$07 cliques that can contribute extra rounds when $w$08 (Miller et al., 31 Jul 2025).

The 2025 classification states that a complete set of solutions is provided for up to 150 players. In that appendix-level sense, “complete set” means a full classified table of best-known constructions and round counts for all instances in the stated range, not that every one of those instances is maximal (Miller et al., 31 Jul 2025).

4. Greedy and online SGP

The 2020 work studies a different problem: not the classical offline existence question directly, but a greedy or online guarantee problem motivated by Swiss-system tournament scheduling (Schmand et al., 2020). Rounds are selected one by one, adaptively, with no preplanning and no ability to revise earlier rounds. The algorithm starts with $w$09, repeatedly chooses an arbitrary feasible $w$10-factor, deletes its clique edges, and stops when no $w$11-factor remains (Schmand et al., 2020).

Its principal theorem is that for each $w$12 and $w$13, the greedy algorithm outputs a tournament with at least

$w$14

rounds (Schmand et al., 2020). In scheduling language: for any number $w$15 of golfers divisible by $w$16, if in each week one chooses any feasible partition into groups of size $w$17, then one is guaranteed at least

$w$18

weeks before getting stuck (Schmand et al., 2020).

This theorem is explicitly not a statement about the optimum number of rounds in the classical SGP. It is a worst-case lower bound for arbitrary greedy round-by-round scheduling (Schmand et al., 2020). That distinction is essential. In structured offline instances, a complete schedule may have as many as

$w$19

rounds, which is roughly $w$20 times larger than the greedy guarantee (Schmand et al., 2020). The result is therefore best understood as a robust online guarantee, not as an exact characterization of optimal schedules.

The bound is tight for the greedy model. The paper proves that there are infinitely many $w$21 for which there exists a tournament that cannot be extended after

$w$22

rounds (Schmand et al., 2020). The tightness construction takes

$w$23

for infinitely many suitable integers $w$24, chooses a set $w$25 with

$w$26

and schedules rounds so that no edge between $w$27 and $w$28 is ever used. After $w$29 rounds, all edges inside $w$30 are exhausted, and any further $w$31-factor would require more outside vertices than exist because

$w$32

This gives exact tightness for infinitely many instances (Schmand et al., 2020).

The same paper also gives a conditional characterization. Assuming the Equitable $w$33-Coloring Conjecture, known for $w$34, a tournament with

$w$35

rounds is non-extendable if and only if $w$36 is a subgraph of the complement $w$37 of the feasibility graph (Schmand et al., 2020). Under that conjecture and when $w$38, choosing the last greedy round carefully can always yield one additional round: $w$39 Because this improvement is conditional, the main unconditional statement remains the lower bound above (Schmand et al., 2020).

5. Algorithmic formulations: SAT, set constraints, and approximation

The set-constraint approach models SGP declaratively, then automatically encodes the model into SAT (Lardeux et al., 2014). The central idea is that a group is a set of golfers and a weekly schedule is a matrix of such set variables $w$40. This eliminates positional variables, because order inside a group is irrelevant (Lardeux et al., 2014). The socialization condition is expressed either by an implication form,

$w$41

$w$42

or by the bounded-intersection form

$w$43

The paper keeps the implication formulation for experiments because it yields lower asymptotic complexity (Lardeux et al., 2014).

The encoding framework is generic for set CSPs. It introduces one Boolean support variable for each element of the support of each set, and supplies generic encoding rules for membership, equality, inclusion, union, intersection, multi-union, multi-intersection, difference, and cardinality (Lardeux et al., 2014). Cardinality is encoded using the unary totalizer/comparator encoding of Bailleux and Boufkhad, rather than a combinatorial subset encoding considered too large (Lardeux et al., 2014).

The reported asymptotic complexity of the implication-based socialization encoding is

$w$44

whereas the cardinality-intersection formulation has

$w$45

This is the stated reason for preferring (12) over (13) in the implementation and experiments (Lardeux et al., 2014).

Symmetry breaking is treated in two distinct ways: by adding constraints and by modifying the model itself (Lardeux et al., 2014). The first strategy fixes the first week in a canonical way and then spreads the first $w$46 golfers across future weeks. As added constraints, these are

$w$47

and

$w$48

As model refinements, the same symmetries are handled by shrinking supports and redefining variables, thereby reducing SAT instance size before clause generation (Lardeux et al., 2014).

The comparative terminology used in that paper is: DE for direct encoding, TME for the Triska-Musliu improved hand-written encoding, TMESB for TME with symmetry breaking, SCE for set-constraint encoding, SCESBC for SCE with symmetry breaking by adding constraints, and SCESBM for SCE with symmetry breaking by modifying the model (Lardeux et al., 2014). The paper claims and experimentally supports that the automatically generated SAT instances have fewer clauses than the improved hand-written encoding, and that after unit propagation they also use fewer variables while solving faster on hard instances (Lardeux et al., 2014).

The greedy scheduling paper gives a different algorithmic perspective. With the upper bound

$w$49

and the lower bound

$w$50

it derives

$w$51

and also states the explicit approximation ratio

$w$52

Accordingly, the greedy algorithm is interpreted as a polynomial-time constant-factor approximation algorithm for the SGP maximization problem (Schmand et al., 2020).

6. Proof mechanisms, examples, and limitations

The proof of the greedy lower bound is based on a complement-coloring argument using the Hajnal–Szemerédi theorem (Schmand et al., 2020). After $w$53 rounds, every vertex has lost exactly $w$54 incident edges, so

$w$55

If

$w$56

then

$w$57

hence in the complement graph

$w$58

With $w$59, this gives $w$60, so Hajnal–Szemerédi yields an equitable $w$61-coloring of $w$62, and since the color classes all have size exactly $w$63, this corresponds to a $w$64-factor in $w$65. Therefore the algorithm cannot stop before round

$w$66

(Schmand et al., 2020).

The design-theoretic literature provides explicit examples illustrating the contrast between RBIBD and RGDD schedules. A schedule with $w$67, $w$68, $w$69 blocks per round, and $w$70 rounds is maximal because

$w$71

and every pair appears exactly once, so it comes from an RBIBD$w$72 (Miller et al., 31 Jul 2025). By contrast, the $w$73, $w$74 example has $w$75 blocks per round and $w$76 rounds, is also maximal because

$w$77

but does not realize all pairs because it comes from an RGDD rather than an RBIBD (Miller et al., 31 Jul 2025).

The greedy theorem can also be instantiated numerically. For $w$78, $w$79, it guarantees

$w$80

while the pair-count upper bound gives $w$81 rounds integrally. For $w$82, $w$83, the unconditional worst-case guarantee is only

$w$84

and for $w$85, $w$86, it is

$w$87

These examples are presented specifically to show that the greedy theorem is a safe guaranteed minimum rather than a prediction of typical or optimal performance (Schmand et al., 2020).

The SAT literature highlights a different practical limitation: complete symmetry breaking is possible in principle but usually impractical due to too many constraints (Lardeux et al., 2014). It also notes that support size strongly affects SAT instance size, although for SGP the basic supports are already minimal (Lardeux et al., 2014). The design-theoretic literature, in turn, is strongest for $w$88 and $w$89, weaker for larger $w$90, where many instances are handled by best-known constructions rather than complete maximality theorems (Miller et al., 31 Jul 2025).

Taken together, these strands show that SGP is not a single research problem but a family of related questions. One line studies maximal offline schedules through RBIBDs, RGDDs, URDs, MOLS, RTDs, and explicit constructions (Miller et al., 31 Jul 2025). Another studies declarative modeling and automated SAT compilation for exact search on fixed parameter triples $w$91-$w$92-$w$93 (Lardeux et al., 2014). A third studies worst-case guarantees for arbitrary greedy round-by-round scheduling and turns that guarantee into a constructive approximation algorithm (Schmand et al., 2020). This suggests that the term “Social Golfer Problem” now denotes both a classical extremal design problem and a broader algorithmic domain spanning exact modeling, constructive design theory, and online scheduling.