Proposition 2 — unilateral auditing decisions when the buyers compete
ProvedSupplierAudit.Competition.proposition_2Consider the auditing game with competing buyers, , under the standing assumptions of the model and the interior-effort assumption . Let and be given by eqs. (1) and (2). There exist thresholds such that, for every fixed audit cost :
- if , the unique equilibrium is : each buyer audits only his independent supplier, with effort ;
- if , the equilibria are exactly , and : either each buyer audits his independent supplier with effort , or one buyer audits his independent supplier with effort and the other audits none of his suppliers;
- if , the equilibria are exactly and ;
- if , the unique equilibrium is : neither buyer audits any supplier.
Here a profile lists and . In every case the common supplier, the one with the higher centrality, receives zero auditing effort: under downstream competition an audit of the common supplier would let the rival free-ride.
Formalization Note "Unique equilibrium" means the equilibrium set is a singleton, and "two types of equilibria" means the set consists of exactly the three listed profiles ("one buyer … the other …" covers both labellings). The ordering (Lemma OA7) is part of the conclusion. because is a fixed cost. Equilibria follow the tie-breaking rule of p. 10 (a buyer indifferent between auditing and not auditing does not audit), without which parts 2–4 fail at and . The interior-effort assumption of p. 10 is encoded as the single hypothesis on the explicit formula (2).
import Mathlib import Definitions.Def_SupplierAudit_Competition_Model
namespace SupplierAudit.Competition
theorem proposition_2 (P : Params) (hβ : 0 < P.β) (hint : eHatI P < 1) :
∃ KL KM KH : ℝ, KL < KM ∧ KM < KH ∧
∀ K : ℝ, 0 ≤ K →
(K < KL → EqSet P K = {((eStarI P, 0), (eStarI P, 0))}) ∧
(KL ≤ K → K < KM → EqSet P K =
{((eStarI P, 0), (eStarI P, 0)), ((eHatI P, 0), (0, 0)), ((0, 0), (eHatI P, 0))}) ∧
(KM ≤ K → K < KH → EqSet P K = {((eHatI P, 0), (0, 0)), ((0, 0), (eHatI P, 0))}) ∧
(KH ≤ K → EqSet P K = {((0, 0), (0, 0))}) := by sorry
end SupplierAudit.Competition
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.