Because it’s forcing the odds, as per definition of rigging.
No. You just need to show it takes fewer matches in a rigged system vs. a random one to claim everything is fine. It needs to be shown that rigging gets people to where they belong more efficiently than random SR only system. But the Virial theorem says for large populations (distributed normally by skill), random is best possible. So current laddering is handicapped and not fair.
It is as per dev statements and patents. See for example:
That’s forcing the odds “for match fairness”, therefore it’s rigging as per definition.
Trying to determine the outcome of the game, and rigging for it, before it’s even played - is nothing like any other ranked environment. You can assign pbsr and sr bonuses for deltas incurred by randomly shipping two teams around an SR margin. No place for MMR except to rig “for fairness” - which makes the overall laddering process anti-competitive and unfair.
That would be random SR naive matchmaking. With MMR rigging, it’s cherry picking coins that are biased to fall one way or the other, and shipping 6 of them together to balance the other 6. It’s rigging the match outcome to be 50-50 by picking biased coins.
Chess is a two player zero sum sequential combinatorial game. It’s state space doesn’t change with balance patches, and it will soon be weakly solved (for example, a proof by induction on base games that white can always force a win, which is greatly suspected).
Chess is in a simpler complexity class than Overwatch. OW is an N-player stochastic differntial game you can transform to a fixed base game with perturbations and adapt epsilon Nash strategies for via e.g. pointer networks or quantum gans, like alpha.star.
They randomly seed or have you qualify for a bracket, then let you (and/or your team) progress naturally through the ladder, brackets, tournaments, etc. Even for single player ranking systems (like Chess), they use only 1 metric (elo), rank you accordingly, pay you out accordingly, and matchmake you naively around your current elo projection. If Hou Yifan is climbing a new account in Chess, the matchmaker doesn’t analyze her performance and cherry pick her subsequent opponents. Who she faces on her climb is entirely random around her elo and winrate. And there is no adaptation to how she is doing or what her gameplay was recently like.
I did a rough calc and also got 57k accounts to move the population mean 250 sr. Where are those numbers from? Who cares…because that’s not the issue. If you are attempting to climb through a bracket of 7% of the population (by player % skill), but it actually contains 11% of the accounts, you’re playing a lot more matches to sieve through. You want to play against diamond players and outrank them, not diamond accounts, which could be over-represented by master players parking alts over and over, each one having a constant-sum amount of SR to distribute, imparting geometric amounts of additional effort for anyone attempting to ladder through.
Have you shown math to dispute the following?:
As well as:
As well as:
And he goes on to give example using race car drivers and race times:
So you really can’t have alts + rigging + 0 resets and call it “fair” laddering.
I have to side with Receipts because the logic holds. His examples are extremely conservative (they argue around a data-free base case). Which is the best you’re going to get unless you can show actual data.