AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingWinner

defimported Lean

The virtual-value winner with deterministic tie-breaking.

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.virtualSurplusMaximizingWinner
    [Fintype I] [Nontrivial I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) : I
Defined in
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingWinner`
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 29

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
/-- The virtual-value winner with deterministic tie-breaking. -/
noncomputable def BayesianSingleItemAuction.virtualSurplusMaximizingWinner
    [Fintype I] [Nontrivial I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) : I :=
  Auction.argmaxBid (A.virtualScore b)
See it in the graphDiscuss this resultChallenge it