AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAuction

defimported Lean

The Bayesian auction using the virtual-surplus mechanism and the original priors.

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.virtualSurplusMaximizingAuction
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) : BayesianSingleItemAuction I
Defined in
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAuction`
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 15
Used by 23

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 Bayesian auction using the virtual-surplus mechanism and the original priors. -/
noncomputable def BayesianSingleItemAuction.virtualSurplusMaximizingAuction
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) : BayesianSingleItemAuction I where
  allocationRule := (A.virtualSurplusMaximizingMechanism).allocationRule
  paymentRule := (A.virtualSurplusMaximizingMechanism).paymentRule
  prior := A.prior
  prob_prior := A.prob_prior
  opponentPrior := A.opponentPrior
  prob_opponentPrior := A.prob_opponentPrior
  typeData := A.typeData
See it in the graphDiscuss this resultChallenge it