genpark-nash-equilibrium-lemke-howson-bimatrix-skill
mcp
Warn
Health Warn
- No license — Repository has no license file
- Description — Repository has a description
- Active repo — Last push 0 days ago
- Low visibility — Only 7 GitHub stars
Code Pass
- Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
- Permissions — No dangerous permissions requested
No AI report is available for this listing yet.
Exact mixed-strategy Nash equilibrium solver for two-player strategic bimatrix normal-form games
README.md
Nash Equilibrium Bimatrix Solver Skill
Exact solver computing pure and mixed-strategy Nash equilibria in 2-player strategic normal form games.
flowchart TD
Payoff["Bimatrix Payoffs (A, B)"] --> BestResponse["Check Pure Best-Response Crossings"]
Payoff --> Indifference["Solve Marginal Indifference Equation System"]
BestResponse --> PureEq["Pure Nash Equilibria List"]
Indifference --> MixedEq["Mixed Strategy Vector (p, 1-p) & (q, 1-q)"]
Features
- 100% Python Standard Library: Analytical solving of linear indifference equations.
- Pure & Mixed Detection: Simultaneously returns all pure saddle points and mixed solutions.
- MCP Server Ready: Direct stdio integration for multi-agent game orchestration.
Reviews (0)
Sign in to leave a review.
Leave a reviewNo results found