plackett_luce_entropy
def
Shannon entropy (natural logarithm) of the Plackett-Luce distribution over the rankings of S.
Statement
noncomputable def plackett_luce_entropy (w : ℕ → ℝ) (S : Finset ℕ) : ℝ
- Defined in
- Preference Elicitation as Average-Case Sorting, AAAI 2021, Sec. 5 (Plackett-Luce model D_w and its entropy H(D_w)); formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Built on 2
- plackett_luce_probPlackett-Luce probability of a ranking (best first): the product over positions of the weight of the alternative placed there divided by…
- rankings_ofThe rankings of a finite set S of alternatives: all orderings of S as duplicate-free lists.
- Used by 4
- plackett_luce_entropy_geometric_leFor geometric weights phi^a with 0 < phi < 1, the Plackett-Luce entropy on any set of n alternatives is at most C(phi) * n with C(phi) =…
- plackett_luce_surprisal_measureFor weights w : ℕ → ℝ and number of items n : ℕ, the pushforward measure on ℝ of the standardized surprisal (-log P(l) - H) / sqrt(n)…
- plackett_luce_entropy_eqChain rule: the Plackett-Luce entropy on S equals the entropy of the first choice plus the expected Plackett-Luce entropy of the remaining…
- plackett_luce_geometric_entropy_linearConjecture of Preference Elicitation as Average-Case Sorting (AAAI 2021): for every phi in (0,1) the Plackett-Luce model with weights (1,…
Lean source view module on GitHub
/-- Shannon entropy (natural log) of the Plackett–Luce distribution on rankings of `S`. -/ noncomputable def plackett_luce_entropy (w : ℕ → ℝ) (S : Finset ℕ) : ℝ := ∑ l ∈ rankings_of S, Real.negMulLog (plackett_luce_prob w l)