{"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","summary":"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<t<1; rank 1 is best. Equivalently, the logarithm of…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true}