Positional Scoring Matching Rules

• Positional Scoring Matching Rules is a framework that assigns parameterized scores to ranking positions, aggregating individual scores to determine winners from full or partial queries.
• The framework employs binomial-basis vectors and query complexity analysis to characterize when scoring rules can be computed, revealing intrinsic limitations such as the need for full rankings in plurality scenarios.
• Applications span voting protocols, sports tournaments, string matching algorithms, and positional games, with both geometric and optimal scoring families offering practical trade-offs and equilibrium insights.

A positional scoring matching rule is a framework wherein alternatives, candidates, or patterns are ranked or matched according to positionally-weighted scores defined by a parameterized scoring vector, and outcomes (rankings, winners, or matches) are determined by aggregating these positional scores over multiple contests, queries, or data alignments. These rules underpin diverse domains including voting protocols, rank aggregation, competitive tournament systems, and even exact string matching algorithms.

1. Fundamental Definitions and Mathematical Frameworks

Positional scoring rules assign to each position $j$ in an ordering of $m$ alternatives a real score $s_j$, with $s_1 \geq s_2 \geq \cdots \geq s_m$. When aggregating $n$ full rankings $\sigma_1, \dots, \sigma_n$ (e.g., voter ballots), the total score of candidate $c$ is

$$\mathrm{sc}_s^\pi(c) = \mathbb{E}_{\sigma \sim \pi} [s_{\text{position of } c \text{ in } \sigma}]$$

where $\pi$ is a profile-distribution over all $m!$ orderings (Halpern et al., 2024).

In tournaments and sports, these vectors define how many points are awarded for each contest position over a season of results, and the order of total points determines the champion (Csató, 2021). In string matching, each relative position in the pattern is assigned an advancement score based on letter frequencies, yielding a "positional scoring" of pattern shifts (Cantone et al., 2010).

2. Characterization of Computability from Incomplete Information

The central decision question is: for which scoring vectors $s$ can one -- using only partial information (queries of $t < m$ alternatives at a time) -- reliably determine the aggregate winner?

Main Characterization (Halpern et al., 2024):

• For every $m\ge2$ and $1\le t\le m$, a scoring rule $s$ is computable with $t$-queries iff $s$ lies in the subspace $R_{m,t}$ spanned by the binomial-basis vectors

$$\alpha^k_j = \binom{j-1}{k-1} \binom{m-j}{t-k} \qquad \text{for}\ j=1,\ldots,m,\ k=1,\ldots,t.$$

Equivalently, only those scoring rules expressible as $s = \sum_{k=1}^t \lambda_k \alpha^k$ can be computed from responses to all possible $t$-element subset queries. Plurality (the $(1,0,\ldots,0)$ vector) is never in $R_{m,t}$ for $t < m$, and thus requires full rankings for information-theoretic computation.

A swap construction shows that if $s \notin R_{m,t}$, then there exist $t$-indistinguishable profiles with different $s$-winners, signifying an intrinsic limitation.

3. Algorithmic and Query Complexity Analysis

Deterministic Query Complexity (Halpern et al., 2024):

• Let $t^*$ be the smallest $t$ with $s \in R_{m,t^*}$.
• The minimal number of $t$-queries required is

$$\mathrm{Cov}(m, t, t^*) \geq \frac{\binom{m}{t^*}}{\binom{t}{t^*}}$$

where $\mathrm{Cov}(m, t, t^*)$ is the size of the minimal $t$-set covering system for all $t^*$-subsets.

• The tight deterministic query complexity is $\Theta(m^{t^*})$.

Randomized Algorithms (Halpern et al., 2024):

• If a randomized algorithm uses $\delta\cdot\mathrm{Cov}(m,t,t^*)$ queries, the success probability $p$ is bounded by

$$p \leq \min \left\{ \delta + \frac{1}{m}, \ \delta + (1 - \delta) \frac{1}{t^*} \right\}$$

For constant $t,t^*$, realizing any fixed improvement over uniform random guessing requires $\Omega(m^{t^*})$ queries.

Special Case: $m=3$, $t=2$ (Borda via pairwise queries):

• One random pair query yields success probability at most $1/3 + o(1)$; two pair queries give at most $1/2 + o(1)$.

4. Rule Selection: Axiomatic and Empirical Considerations

Geometric and Optimal Scoring Families (Kondratev et al., 2019, Csató, 2021):

• The "geometric" family arises by requiring independence of unanimous winners/losers: $$s^k_j = p^{k-j}, \quad p > 0, \text{ up to affine transform}$$
  • $p \to \infty$: Plurality $(1,0,\dots,0)$
  • $p = 1$: Borda $(k-1,k-2,\dots,0)$
  • $p \to 0$: Antiplurality $(1,\dots,1,0)$.
• The "optimal" score vector for aggregated ranking given i.i.d. symmetric utilities $u^{(j)}$ is

$s_j = \mathbb{E}[u^{(j)}]$

where $u^{(j)}$ is the $j$-th order statistic (Kondratev et al., 2019).

Empirical Fit and Tradeoffs:

• Empirical analysis in contexts such as F1 racing reveals a Pareto frontier between minimizing early championship clinch probability and the risk of "winless" champions. Both historical and geometric (p ≈ 1.3–1.6) rules can achieve near-optimal trade-offs (Csató, 2021, Kondratev et al., 2019).
• In sports where time/score distributions are nearly uniform, a geometric rule with suitable $p$ closely matches the optimal ordinal rule.

5. Applications Beyond Voting: String Matching and Games

String Matching (Cantone et al., 2010):

• The "worst-character rule" for pattern matching algorithms is a positional scoring matching rule: for each position $i$ in the pattern, compute the expected advancement $\Delta(i)$ for inspecting at $i$, then select the $q$ maximizing $\Delta(q)$. This generalizes Horspool and Quick-Search heuristics, unifying classic pattern matching under the positional scoring matching umbrella.

Scoring Positional Games (Bagan et al., 2022):

• In 2-player positional games on graphs, players alternately claim vertices and score the number of fully controlled edges. In the Maker-Maker convention, differences in edge counts correspond to positional scoring under optimal adversarial selection. Computing optimal scores is PSPACE-complete in the Maker-Breaker setting but linear-time solvable in the Maker-Maker case.

6. Theoretical Implications for Stability and Equilibrium

Electoral Equilibria and Rule Shape (Cahan et al., 2013):

• The structure of the scoring vector $s$ determines the existence and nature of Nash equilibria in electoral competition:
  • Strictly convex rules (rapid drop-off in scores) preclude nonconvergent equilibria (NCNE).
  • Borda-type or "block" rules enable multipositional NCNE, facilitating clustering.
  • The intermediate parameter $c(s,m) = (s_1 - \bar{s})/(s_1 - s_m)$ predicts equilibrium regimes:
  • Only convergent equilibria for $c(s,m) \leq 1/2$ (e.g., Borda, antiplurality).
  • Multipositional or bi-positional equilibria for suitable best-rewarding rules.

7. Optimization and Learning of Scoring Rules

Learning Positional Scoring Rules (Caragiannis et al., 2016):

• When only partial rankings and weak supervision (pairwise constraints) are available, OptPSR seeks a scoring vector maximizing consistency with known constraints. Exact computation is polynomial-time for fixed $d$ but NP-hard in general, with a tight hardness of $(23/24 + \eta)$ factor.
• Approximate methods, including BestApproval (selecting the best $t$-approval rule) guarantee a $1/d$-fraction of optimum; more refined schemes (ApxPSR$_k$) interpolate between speed and quality.
• Experimental evidence shows that simple scoring vectors (e.g., Harmonic) frequently recover nearly all ground-truth relations in practical rank aggregation.

---

Summary Table: Main Families and Their Properties

Scoring Vector Family	Defining Property	Key Example
Geometric ($p>0$)	IUL & IUW axioms; $s_j = p^{k-j}$	Borda ($p=1$), Plurality ($p\to\infty$)
Optimal (for $F_\lambda$)	Aggregates via expected utilities	$s_j = \mathbb{E}[u^{(j)}]$
$t$-Query Compatible $R_{m,t}$	Binomial-basis span	Computable from $t$-subsets

---

References: (Halpern et al., 2024, Csató, 2021, Kondratev et al., 2019, Caragiannis et al., 2016, Cahan et al., 2013, Bagan et al., 2022, Cantone et al., 2010).