Delphi.science

Conditional logarithmic partner ranks in exponential matching markets

Source: github.com/bocowgill/conditional-log-rank/tree/51cad25b3b81…

Bo Cowgill

Palomar Registrypalomar/PALOMAR-2026-11-09-000007Nov 9, 2026math.PRscore 0

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…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-09-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000007/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'