Theorem 5.8, PDF p. 17 — every chain stable outcome (X, p^X) extends to a competitive equilibrium (X, p) with p = p^X on X
ProvedTradingNetFlow.ChainStable.theorem_5_8chain-stabilitycompetitive-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stable-outcomestrading-networks
Let be a trading network with finitely many agents and trades, in which every trade has distinct seller and buyer and every valuation is M-concave in the signed representation (equivalently, every agent's preferences are fully substitutable). Suppose the outcome with prices is chain stable:
- it is individually rational, for every agent , and
- no nonempty chain with and prices blocks it, meaning that for every agent involved in every contains .
Then there is a price vector such that is a competitive equilibrium and
Together with Theorem 5.7 (a competitive equilibrium is stable, hence chain stable), this shows that in trading networks with fully substitutable preferences all the stability notions of Hatfield et al. (2013) coincide with competitive equilibrium: the weakest one, chain stability, already implies the strongest.
Preamble
import Mathlib import Definitions.Def_TradingNetFlow_ChainStable_Model
Formal statement
namespace TradingNetFlow.ChainStable
open Finset
variable {N E : Type*} [Fintype N] [DecidableEq N] [Fintype E] [DecidableEq E]
theorem theorem_5_8 (G : Economy N E) (hG : G.Standing) (X : Finset E) (pX : E → ℝ)
(hX : G.IsChainStable X pX) :
∃ p : E → ℝ, G.IsCompetitiveEquilibrium X p ∧ ∀ e ∈ X, p e = pX e := by sorry
end TradingNetFlow.ChainStable
Source
Candogan, Epitropou & Vohra, Competitive Equilibrium and Trading Networks: A Network Flow Approach, IHS Economics Series Working Paper 323 (Aug. 2016), PDF p. 17, Theorem 5.8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.