Id: palomar/PALOMAR-2026-11-09-000007 Url: https://github.com/bocowgill/conditional-log-rank/tree/51cad25b3b813abfc86ee74805a472b7622294c5 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000007-v1.json Repo: https://github.com/bocowgill/conditional-log-rank Tags: math.PR, math.CO, msc:60C05, msc:05A16, msc:91B68 Score: 0 Title: Conditional logarithmic partner ranks in exponential matching markets Trust: high Domain: math.PR Source: palomar Authors: Bo Cowgill Reviews: 0 Subject: math.PR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-09 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-09-000007 Switching costs relax pairwise stability by requiring both members of a blocking pair to gain more than a common nonnegative cost. In balanced markets with n firms and n workers and independent rate-one exponential utilities, this package proves a conditional benchmark for ordinal partner ranks in Lean. Fix a matching and condition the market on its stability. If twice the cost divided by log n tends to rho in [0,1), the conditional probability that average one-based firm partner rank is at most n^t tends to (t-rho)/(1-rho) for every rho