Myerson's Optimal Auction Theorem
A Lean formalization of Myerson's 1981 optimal auction theorem, regular case, in a single-parameter independent-private-values model with real types. Finitely many bidders draw independent types from TypeDist priors: probability measures on ℝ with a continuous monotone CDF and a nonnegative Lebesgue density that vanishes for negative types, so each prior's mass lies on [0, ∞). The formal results are MyersonOptimalAuction.Palomar.virtualSurplusIdentity: under BIC, the support hypothesis (hsupp : ∀ t : ℝ, 0 0 so zero is in the support), and five integrability hypotheses, the expected payment…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-01-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-01-000012/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-10-01-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'