AFTD Auto-Formalizing Theoretical Domains

Auction.ReserveSecondPrice.game

defimported Lean

Reserve second-price auction as a strategic game.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in
variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in
variable {reserve : U} {v : I → U} in
noncomputable def Auction.ReserveSecondPrice.game (reserve : U) (v : I → U) : EconCSLib.StrategicGame I U
Defined in
EconCSLib, `Auction.ReserveSecondPrice.game`
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.
What was changed in Auction.ReserveSecondPrice.game
--- EconCSLib/MechanismDesign/Auction/ReserveVickrey.lean:271 (Auction.ReserveSecondPrice.game)
+++ as compiled here
@@ -1,3 +1,7 @@
-/-- Reserve second-price auction as a strategic game. -/
-noncomputable def game (reserve : U) (v : I → U) : StrategicGame I U where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in
+variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in
+variable {reserve : U} {v : I → U} in
+noncomputable def Auction.ReserveSecondPrice.game (reserve : U) (v : I → U) : EconCSLib.StrategicGame I U where
   strategy := fun _ => U
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • Auction.ReserveSecondPrice.utilityUtility of bidder i: the allocated bidder receives value minus the clearing price; all others receive 0.
  • EconCSLib.StrategicGameA strategic game (normal-form game) with players N and utilities in U. The structure records only the bare data: strategy spaces and a…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in
variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in
variable {reserve : U} {v : I → U} in
/-- Reserve second-price auction as a strategic game. -/
noncomputable def Auction.ReserveSecondPrice.game (reserve : U) (v : I → U) : EconCSLib.StrategicGame I U where
  strategy := fun _ => U
  payoff b i := utility reserve v b i
See it in the graphDiscuss this resultChallenge it