Lemma 1 — duality of RANKING
ProvedKVVMatching.Ranking.lemma_1bipartite-matchingonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Fix a bipartite graph and an ordering of each side. Girls arriving in their order and selecting the highest-ranked available boy produce the same set of edges as boys arriving in their priority order and selecting the highest-ranked eligible girl, where the girls' priority order is their original arrival order.
This duality principle allows the analysis to exchange which side arrives online while retaining the individual matched edges.
Formalization Note Each permutation maps a time or priority index to a vertex; a smaller index arrives earlier or has higher priority. The two runs' edge pairs are placed in the same (boy, girl) orientation before comparison.
Preamble
import Definitions.Def_KVVMatching_Ranking_GreedyRun
Formal statement
namespace KVVMatching.Ranking
/-- Lemma 1, p. 353: the duality principle for fixed orders. -/
theorem lemma_1 {n : ℕ} (adj : Fin n → Fin n → Prop)
(boyOrder girlOrder : Equiv.Perm (Fin n)) :
(greedyRun (fun g b => adj b g) girlOrder boyOrder
(fun _ _ _ => false)).image Prod.swap =
greedyRun adj boyOrder girlOrder (fun _ _ _ => false) := by sorry
end KVVMatching.Ranking
Source
Karp, Vazirani, Vazirani, An Optimal Algorithm for On-line Bipartite Matching, STOC 1990, p. 353, Duality Principle and Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.