@masiarek I think this is a useful way of looking at it: sincere, consistent voting should lead to Smith//Approval, as long as the Approval (or score) round is conducted after the Smith set is already known. So I would push back somewhat on “same winner, no second election,” because in SSVV, the Smith set (as well as the Score winner set) is known before the scoring of candidates in step (2.2). That sequencing can matter, even if sincere voting ultimately produces the same outcome as Smith//Approval, unless voters have genuine independent approvals per candidate.
In fact, it may be that most strategic benefits of SSVV are caused by the score/approval in the Smith set being informed by the Smith set itself, which would mean Smith//Smith-informed-Approval is a reasonable comparator, and it may be superior.
I also agree that in the singleton case with sincere voters, the validation step is redundant. If the Score set is ({A}) and the Smith set is ({B}), then a majority vote consistently with sincere preferences should choose the Smith set, since that same majority sincerely prefers (B) to (A). Probably, often the Score winner and Condorcet winner will coincide anyway.
Where I think SSVV differs most substantially from Smith//Approval is in strategic behavior rather than sincere outcomes, particularly when strategic voting changes the composition of the reported Smith set. Smith methods like Smith//Approval automatically commit the electorate to choosing from the reported Smith set, whereas SSVV does not—since voters first see the Score and Smith sets, the majority can decide whether they actually want to validate a Smith set that may have been distorted by tactical voting.
That may matter specifically for burial. Suppose burial changes the Smith set from something relatively compelling into a larger or stranger set. The burial strategy has succeeded in manipulating the pairwise structure, but has also changed the object voters are being asked to validate. Voters who prefer the Score winner to every member of the Smith set obviously choose Score, but even some voters who prefer one Smith candidate to the Score winner might choose Score rather than risk one of the other Smith candidates winning.
So I think your observation points toward an interesting strategic question about the method. Manufacturing a cycle can indeed get a candidate into the Smith set or remove another candidate from it, but unlike under Smith//Approval, that does not automatically get the preferred candidate into the decisive election, nor does it necessarily eliminate the buried candidate from consideration altogether, since the manipulated Smith set has to survive validation by majority vote.
I don’t know yet whether that additional hurdle is strong enough to make enough of a difference to warrant it, but I think that’s the main distinction from Smith//Approval.
My simulations so far have been exploratory and conducted interactively through ChatGPT 5.6-Sol, using spatial and nonspatial electorates with coordinated factions iteratively trying various score-compression, compromise, and burial strategies, so I would not treat them as an equilibrium analysis. They do suggest that the validation stage can sometimes neutralize successful manipulation of the Smith set (primarily accomplished through burial), but that result needs more systematic investigation.
I also just experimented with public B and hidden A, or revealing only the mean score of A rather than candidate identity. This mostly improved behavior even more, because manipulating the Smith set becomes more risky in validation if the Score winner set is kept hidden. But it opens a can of worms in terms of “information engineering” to improve incentives. Even if the Score “escape hatch” isn’t used, its mere existence changes strategic incentives.