The class of BIC/BIR mechanisms
DefinitionDSICCompComp_Supplement_IsAdmissibleBICcompetition-complexitymechanism-designp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-maximization
is the set of mechanisms for additive bidders over items that are BIC and BIR with respect to and feasible: for every value profile , for all , and for every item (each item is allocated at most once).
This is the mechanism class over which the optimal BIC revenue is taken.
Formalization Note Regularity requirements are added: payments are measurable, mirroring the published DSIC class IsAdmissibleDS, and the BIC/BIR definitions themselves require the relevant ex-post utility integrands to be integrable against . These conditions make the expected revenue and interim expectations meaningful and can only shrink .
Definition code
import Mathlib
import Definitions.Def_DSICCompComp_Supplement_IsBIC
import Definitions.Def_DSICCompComp_Supplement_IsBIR
open MeasureTheory
open scoped NNReal
namespace DSICCompComp
namespace Supplement
/-- The class `B(D)` of mechanisms that are BIC/BIR with respect to `D`
(Ryu–Weinberg–Xue, *The DSIC Competition Complexity of Additive Buyers over Independent Items*, STOC 2027
submission, manuscript of Nov. 3, 2026, sha256 bf61bfdb…,
Section 2, pp.5–6 (pdf pp.6–7)): feasible (ex-post allocation probabilities in `[0,1]`, each item
allocated at most once), BIC and BIR with respect to `D`.
**Formalization Note** Measurable payments are required, mirroring the published
`MultiItemRev.MultiBuyer.IsAdmissibleDS`, so that expected revenue is defined. Integrability of
the interim-utility integrands is part of `IsBIC` and `IsBIR` themselves. These regularity
requirements shrink `B(D)`. -/
def IsAdmissibleBIC {n m : ℕ} (D : Fin m → ProbabilityMeasure ℝ≥0)
(M : MultiItemRev.MultiBuyer.MechanismN n (Fin m)) : Prop :=
MultiItemRev.MultiBuyer.IsFeasibleN M ∧ IsBIC D M ∧ IsBIR D M ∧
∀ i, Measurable fun v => M.s v i
end Supplement
end DSICCompComp
Source
Ryu–Weinberg–Xue, The DSIC Competition Complexity of Additive Buyers over Independent Items, STOC 2027 submission (manuscript of Nov. 3, 2026, sha256 bf61bfdb…), Section 2, pp.5–6 (pdf pp.6–7)