Flow conservation of a dual solution (Definition C.1)
DefinitionDSICCompComp_Supplement_FlowConservationlp-dualitymechanism-designp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-maximization
A dual solution assigns a multiplier to each DSIC constraint: bidder , profile of the others, value and report . It satisfies flow conservation if for all bidders , profiles and values ,
Equivalently, for each and , the network with a source , a sink and one node per , with flow on the edge and flow on the edge , conserves flow at every node other than and .
Formalization Note A dual solution is a function lam i v w of a bidder , a full profile (which carries both and ) and a report , with lam i v w . Thus is lam i (Function.update v i v'_i) (some (v i)).
Definition code
import Mathlib
import Definitions.Def_DSICCompComp_Supplement_jointPMF
namespace DSICCompComp
namespace Supplement
/-- Flow conservation of a dual solution `λ` (Ryu–Weinberg–Xue, *The DSIC Competition Complexity of Additive Buyers over Independent Items*, STOC 2027
submission, manuscript of Nov. 3, 2026, sha256 bf61bfdb…,
Definition C.1, pp.35–36 (pdf pp.36–37)): for all bidders `i`, profiles `v_{-i}` of the other bidders
and values `v_i ∈ supp(D_i)`,
`∑_{v'_i ∈ supp(D_i) ∪ {∅}} λ^{v_{-i}}_i(v_i, v'_i) = f(v) + ∑_{v'_i ∈ supp(D_i)} λ^{v_{-i}}_i(v'_i, v_i)`.
**Formalization Note** A dual solution is `lam : (i : Fin n) → ((k : Fin n) → S k) → Option (S i) → ℝ`
with `lam i v w = λ^{v_{-i}}_i(v_i, w)`: one multiplier for each bidder `i`, profile `v ∈ supp(D)`
(which carries both `v_{-i}` and `v_i`) and report `w ∈ supp(D_i) ∪ {∅}` (`none` = `∅`). So
`λ^{v_{-i}}_i(v'_i, v_i) = lam i (Function.update v i v'_i) (some (v i))`. -/
def FlowConservation {n m : ℕ} (E : FiniteSetting n m)
(lam : (i : Fin n) → ((k : Fin n) → E.S k) → Option (E.S i) → ℝ) : Prop :=
∀ (i : Fin n) (v : (k : Fin n) → E.S k),
∑ w : Option (E.S i), lam i v w =
jointPMF E v + ∑ u : E.S i, lam i (Function.update v i u) (some (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…), Definition C.1, pp.35–36 (pdf pp.36–37)