Make your next step
a little clearer.

Panel Ranking Reconciliation

Reconcile a panel decision with complete weighted preferences and trace the strongest supporting paths.

Reconcile a panel decision with complete weighted preferences and trace the strongest supporting paths. Uses the winning-votes Schulze method on two to twelve candidates and one to 128 complete strict ballots; integer ballot weights are one to one million. A direct edge exists only for a strict pairwise win, carrying its winning vote count. Strongest paths maximize their weakest edge; winners are unbeaten by the reverse strongest-path comparison. Ranking layers repeatedly remove the unbeaten remaining candidates. Witnesses use a shortest path in each positive-strength threshold graph, then supplied-index traversal order; absent paths have strength zero and an empty witness. Reported winners are compared as a set. Up to 1,728 strength updates and 132 bounded path searches per record; one or two independent records. Private JSON report retained for 30 days. One-time USD 9.00 job with no subscription. Uses supplied, authorized, non-sensitive records; no provider lookup, external changes, prediction or operational guarantee. Planning methods are chosen analytical models, with no official election, legal apportionment or fairness certification. Document limits are 36,000 UTF-8 bytes, 6,000 value nodes and depth 24; results are limited to 500,000 bytes. All dimensions, references and work profiles are checked before checkout. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

Agent API guide → · Website orders show the report on your private order page.

The complete checkout request must fit within 40,000 UTF-8 bytes. Your input is validated again before an order is created.