Open Research Index

minimax-theorem-lean

Arthur Freitas Ramos

Palomar Registrypalomar/PALOMAR-2026-10-01-000004Oct 1, 2026cs.GTscore 0

A Lean formalization of von Neumann's 1928 finite two-player zero-sum minimax theorem, a foundation of modern game theory and a cornerstone of mathematical economics. Nash equilibrium existence builds directly on its mixed-strategy solution concept by extending equilibrium existence beyond the two-player zero-sum case; this is historical motivation, not a claimed Lean proof of Nash's theorem. The formal result is Minimax.minimax_theorem {A B : Type*} [Fintype A] [Fintype B] [Nonempty A] [Nonempty B] (u : A → B → ℝ) : maxminValue u = minmaxValue u. The reported Palomar registry API search on…

SourceRepositoryJSON

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-10-01-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-01-000004/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-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'