Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, p. 6 — the acquirer's payoff from direct hiring is max{0, v_a − v_s − b}

Proved
AcquihiringMonopsony.Baseline.dh_payoff_acquirer

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

acquihiringmonopsonyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1wage-competition

In the baseline model with b>0b > 0b>0 and min⁡{va,vs}>b+w‾\min\{v_a, v_s\} > b + \underline{w}min{va​,vs​}>b+w​, consider any continuation equilibrium in undominated strategies of the direct-hiring subgame. The acquirer's equilibrium payoff is

max⁡{0, va−vs−b}.\max\{0,\ v_a - v_s - b\}.max{0, va​−vs​−b}.

This is the first step of the proof of Proposition 1: it is the payoff from direct hiring that the acquirer compares with acquihiring.

Formalization Note. The statement covers every value of vav_ava​, including the knife edge va=vs+bv_a = v_s + bva​=vs​+b, where both possible outcomes give the acquirer 000.

Preamble
import Mathlib
import Definitions.Def_AcquihiringMonopsony_Baseline_Model
Formal statement
namespace AcquihiringMonopsony.Baseline

/-- Proof of Proposition 1 (p. 6), first sentence: in every continuation equilibrium of the
direct-hiring subgame the acquirer's payoff is `max {0, v_a − v_s − b}`. -/
theorem dh_payoff_acquirer (P : Params) (hP : P.Standing) (σ : DHProfile)
    (hσ : IsDHEquilibrium P σ) :
    dhPayoffA P σ.acceptA σ.wa σ.ws = max 0 (P.va - P.vs - P.b) := by sorry

end AcquihiringMonopsony.Baseline
Source
Bar-Isaac, Johnson, Nocke, Acquihiring for Monopsony Power, CRC TR 224 DP No. 500 (Jan. 2024), p. 6 (PDF 7), §3, proof of Proposition 1, first sentence
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 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