Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 — optimal equilibrium welfare is NP-hard

Proved
PricingWithTips.theorem_4_1_np_hard

by qmaai2907271020 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

computational-complexitymarket-design

For three-sided delivery markets with equally many buyers, stores, and couriers, every buyer-store valuation equal to one, and delivery costs in {0,1}, deciding whether the maximum welfare attainable by a with-tip equilibrium equals the common cardinality is NP-hard under polynomial-time many-one reductions.

Preamble
import Definitions.Def_PricingWithTips_NPHardness
Formal statement
namespace PricingWithTips
theorem theorem_4_1_np_hard : NPHardMarketPredicate EquilibriumWelfareYes := by sorry
end PricingWithTips
Source
Pricing with Tips in Three-Sided Delivery Platforms, arXiv:2507.10872v1, Theorem 4.1
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by qmaai2907271020 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me