AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule

defimported Lean

Allocates to the highest positive virtual value, otherwise withholds the item.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open scoped BigOperators in
open MeasureTheory in
variable {I : Type*} in
noncomputable def BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) : (I → ℝ) → I → ℝ
Defined in
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 16
Used by 44

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open scoped BigOperators in
open MeasureTheory in
variable {I : Type*} in
/-- Allocates to the highest positive virtual value, otherwise withholds the item. -/
noncomputable def BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) : (I → ℝ) → I → ℝ :=
  fun b i =>
    let w := A.virtualSurplusMaximizingWinner b
    if 0 < A.winningVirtualValue b then
      if i = w then 1 else 0
    else
      0
See it in the graphDiscuss this resultChallenge it