@stevenvo780/st-lang 4.5.0 → 4.5.2

package/dist/game-theory/lemke-howson.js

@@ -0,0 +1,269 @@
+"use strict";
+// ============================================================
+// Lemke-Howson — algoritmo de pivot para Nash de 2-player games
+// ============================================================
+//
+// Versión clásica con tableros. Idea:
+//
+//   - Normalizamos pagos para que sean estrictamente positivos
+//     (sumando un constante grande). Esto no cambia los Nash.
+//   - Trabajamos con dos sistemas en variables x ∈ R^n, y ∈ R^m
+//     más slacks r ∈ R^n, s ∈ R^m:
+//         B^T x + r = 1   con x ≥ 0, r ≥ 0
+//         A   y + s = 1   con y ≥ 0, s ≥ 0
+//     donde A es la matriz de pagos del jugador 1 (NxM) y B la
+//     de pagos del jugador 2 (NxM).
+//   - Cada variable tiene una "etiqueta" en {1..n+m}. En un
+//     vértice completamente etiquetado (Nash), para cada label l
+//     o bien la variable es no-básica (= 0) o su complemento lo es.
+//   - Empezar en el vértice trivial (x=0, y=0; r=s=1) — todas las
+//     etiquetas están "cubiertas" por las variables no-básicas.
+//     Soltamos una etiqueta `startLabel` y pivotamos hasta volver
+//     a un vértice completamente etiquetado.
+//
+// Este algoritmo encuentra UN equilibrio (no necesariamente todos).
+// Cambiar `startLabel` puede llevar a equilibria distintos.
+//
+// Implementación pedagógica: O(n+m) pivotes en práctica.
+// El soporte que ya teníamos (support enumeration) sirve para juegos
+// chicos. Lemke-Howson es alternativa para tamaños medios o cuando
+// uno quiere "algún" Nash rápido.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.lemkeHowson = lemkeHowson;
+const types_1 = require("./types");
+const TOL = 1e-9;
+function lemkeHowson(game, startLabel = 0) {
+    if (game.players !== 2) {
+        throw new Error('lemkeHowson supports only 2-player games');
+    }
+    const n = game.strategies[0];
+    const m = game.strategies[1];
+    if (startLabel < 0 || startLabel >= n + m) {
+        throw new Error(`startLabel ${startLabel} out of range [0, ${n + m})`);
+    }
+    const a1 = game.payoffs[0];
+    const a2 = game.payoffs[1];
+    // Construir matrices A (jugador 1) y B (jugador 2)
+    const A = [];
+    const B = [];
+    for (let i = 0; i < n; i++) {
+        const rowA = [];
+        const rowB = [];
+        for (let j = 0; j < m; j++) {
+            rowA.push(a1[i * m + j]);
+            rowB.push(a2[i * m + j]);
+        }
+        A.push(rowA);
+        B.push(rowB);
+    }
+    // Shift para que sean positivos
+    let minVal = Infinity;
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < m; j++) {
+            const av = A[i][j];
+            const bv = B[i][j];
+            if (av < minVal)
+                minVal = av;
+            if (bv < minVal)
+                minVal = bv;
+        }
+    }
+    const shift = minVal <= 0 ? 1 - minVal : 0;
+    if (shift !== 0) {
+        for (let i = 0; i < n; i++) {
+            for (let j = 0; j < m; j++) {
+                A[i][j] = A[i][j] + shift;
+                B[i][j] = B[i][j] + shift;
+            }
+        }
+    }
+    const labelOf = (v) => {
+        if (v.kind === 0 || v.kind === 1)
+            return v.index;
+        return n + v.index;
+    };
+    const complementOf = (v) => {
+        if (v.kind === 0)
+            return { kind: 1, index: v.index };
+        if (v.kind === 1)
+            return { kind: 0, index: v.index };
+        if (v.kind === 2)
+            return { kind: 3, index: v.index };
+        return { kind: 2, index: v.index };
+    };
+    // System 1: B^T para que las filas sean ecuaciones indexadas por j.
+    const S1 = { mat: [], rhs: [] };
+    for (let j = 0; j < m; j++) {
+        const row = [];
+        for (let i = 0; i < n; i++)
+            row.push(B[i][j]);
+        S1.mat.push(row);
+        S1.rhs.push(1);
+    }
+    const S1_basic = Array.from({ length: m }, (_, j) => ({ kind: 3, index: j }));
+    const S1_nonbasic = Array.from({ length: n }, (_, i) => ({ kind: 0, index: i }));
+    const S2 = { mat: [], rhs: [] };
+    for (let i = 0; i < n; i++) {
+        const row = [];
+        for (let j = 0; j < m; j++)
+            row.push(A[i][j]);
+        S2.mat.push(row);
+        S2.rhs.push(1);
+    }
+    const S2_basic = Array.from({ length: n }, (_, i) => ({ kind: 1, index: i }));
+    const S2_nonbasic = Array.from({ length: m }, (_, j) => ({ kind: 2, index: j }));
+    // Pivot: pasar una no-básica `enter` a básica en el sistema que le
+    // corresponde, y sacar de la base la que pierda con la regla del
+    // cociente mínimo. Devuelve la variable que sale (Var) o null si
+    // el sistema es ilimitado (no debería pasar con shift > 0).
+    function pivotIn(sys, enter) {
+        const S = sys === 'S1' ? S1 : S2;
+        const nonbasic = sys === 'S1' ? S1_nonbasic : S2_nonbasic;
+        const basic = sys === 'S1' ? S1_basic : S2_basic;
+        // columna de `enter` en `nonbasic`
+        let col = -1;
+        for (let c = 0; c < nonbasic.length; c++) {
+            const v = nonbasic[c];
+            if (v.kind === enter.kind && v.index === enter.index) {
+                col = c;
+                break;
+            }
+        }
+        if (col < 0)
+            return null;
+        // Min ratio: filas con coef > 0 de la columna entrante
+        let bestRow = -1;
+        let bestRatio = Infinity;
+        for (let r = 0; r < S.mat.length; r++) {
+            const coef = S.mat[r][col];
+            if (coef <= TOL)
+                continue;
+            const ratio = S.rhs[r] / coef;
+            if (ratio < bestRatio - TOL) {
+                bestRatio = ratio;
+                bestRow = r;
+            }
+        }
+        if (bestRow < 0)
+            return null; // unbounded
+        // Pivot Gauss-Jordan en (bestRow, col)
+        const pivot = S.mat[bestRow][col];
+        const pivRow = S.mat[bestRow];
+        for (let c = 0; c < pivRow.length; c++)
+            pivRow[c] = pivRow[c] / pivot;
+        S.rhs[bestRow] = S.rhs[bestRow] / pivot;
+        for (let r = 0; r < S.mat.length; r++) {
+            if (r === bestRow)
+                continue;
+            const rowR = S.mat[r];
+            const factor = rowR[col];
+            if (factor === 0)
+                continue;
+            for (let c = 0; c < rowR.length; c++) {
+                rowR[c] = rowR[c] - factor * pivRow[c];
+            }
+            S.rhs[r] = S.rhs[r] - factor * S.rhs[bestRow];
+        }
+        const leaving = basic[bestRow];
+        basic[bestRow] = enter;
+        nonbasic[col] = leaving;
+        return leaving;
+    }
+    // Selección de pivote inicial: la variable cuyo label es `startLabel`.
+    // Esa variable está en `nonbasic` de uno de los dos sistemas.
+    let entering;
+    if (startLabel < n) {
+        entering = { kind: 0, index: startLabel }; // x_{startLabel}
+    }
+    else {
+        entering = { kind: 2, index: startLabel - n }; // y_{startLabel-n}
+    }
+    // Pivotear hasta que la complementaria del start vuelva a estar en
+    // la base, o hasta exceder un budget para evitar loops.
+    const maxIter = 4 * (n + m) * (n + m) + 50;
+    let currentSystem = entering.kind === 0 ? 'S1' : 'S2';
+    for (let iter = 0; iter < maxIter; iter++) {
+        const leaving = pivotIn(currentSystem, entering);
+        if (leaving === null)
+            return null; // unbounded → no Nash recovered
+        // Si la saliente es la complementaria de la variable que originalmente
+        // soltamos (startLabel), terminamos.
+        if (labelOf(leaving) === startLabel)
+            break;
+        // Caso contrario: la nueva entrante es la complementaria de la saliente,
+        // en el sistema opuesto.
+        entering = complementOf(leaving);
+        currentSystem = entering.kind === 0 || entering.kind === 1 ? 'S1' : 'S2';
+        // Pero entrar como x o como r requiere que la variable sea no-básica
+        // en su sistema. x_i / r_i son complementarias y ambas viven asociadas
+        // a S1. Igual y/s respecto a S2.
+        if (currentSystem === 'S1') {
+            // las no-básicas de S1 son x_*, las básicas son s_* o r_* o lo que
+            // hayamos pivoteado. Si la variable a entrar es r_i, debe entrar a
+            // S1 si está no-básica allí.
+            currentSystem = 'S1';
+        }
+        else {
+            currentSystem = 'S2';
+        }
+        // Si la entrante no está actualmente no-básica en S{1,2}, intercambiar
+        // sistemas.
+        const candidateSet = currentSystem === 'S1' ? S1_nonbasic : S2_nonbasic;
+        let found = false;
+        for (const v of candidateSet) {
+            if (v.kind === entering.kind && v.index === entering.index) {
+                found = true;
+                break;
+            }
+        }
+        if (!found) {
+            currentSystem = currentSystem === 'S1' ? 'S2' : 'S1';
+        }
+    }
+    // Extraer x e y de las básicas
+    const xVec = new Array(n).fill(0);
+    const yVec = new Array(m).fill(0);
+    for (let r = 0; r < S1_basic.length; r++) {
+        const v = S1_basic[r];
+        if (v.kind === 0)
+            xVec[v.index] = S1.rhs[r]; // x_i
+    }
+    for (let r = 0; r < S2_basic.length; r++) {
+        const v = S2_basic[r];
+        if (v.kind === 2)
+            yVec[v.index] = S2.rhs[r]; // y_j
+    }
+    // Si todo terminó en (0, 0) volvimos al inicial → no encontró Nash.
+    const sumX = xVec.reduce((s, v) => s + v, 0);
+    const sumY = yVec.reduce((s, v) => s + v, 0);
+    if (sumX < TOL || sumY < TOL)
+        return null;
+    // Normalizar a distribuciones de probabilidad
+    const p = xVec.map((v) => v / sumX);
+    const q = yVec.map((v) => v / sumY);
+    // Clean up negativos por ruido numérico
+    for (let i = 0; i < p.length; i++)
+        if (p[i] < 0 && p[i] > -TOL)
+            p[i] = 0;
+    for (let j = 0; j < q.length; j++)
+        if (q[j] < 0 && q[j] > -TOL)
+            q[j] = 0;
+    const dists = [p, q];
+    const payoffs = [
+        (0, types_1.expectedPayoffFromDistributions)(game, 0, dists),
+        (0, types_1.expectedPayoffFromDistributions)(game, 1, dists),
+    ];
+    const supportP = p.filter((x) => x > TOL).length;
+    const supportQ = q.filter((x) => x > TOL).length;
+    const isPure = supportP === 1 && supportQ === 1;
+    return {
+        strategies: [
+            { player: 0, distribution: p },
+            { player: 1, distribution: q },
+        ],
+        payoffs,
+        isPure,
+        isStrict: false,
+    };
+}
+//# sourceMappingURL=lemke-howson.js.map

package/dist/game-theory/lemke-howson.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lemke-howson.js","sourceRoot":"","sources":["../../src/game-theory/lemke-howson.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gEAAgE;AAChE,+DAA+D;AAC/D,EAAE;AACF,sCAAsC;AACtC,EAAE;AACF,+DAA+D;AAC/D,8DAA8D;AAC9D,gEAAgE;AAChE,mCAAmC;AACnC,2CAA2C;AAC3C,2CAA2C;AAC3C,+DAA+D;AAC/D,oCAAoC;AACpC,4DAA4D;AAC5D,iEAAiE;AACjE,oEAAoE;AACpE,kEAAkE;AAClE,gEAAgE;AAChE,kEAAkE;AAClE,6CAA6C;AAC7C,EAAE;AACF,oEAAoE;AACpE,4DAA4D;AAC5D,EAAE;AACF,yDAAyD;AACzD,qEAAqE;AACrE,mEAAmE;AACnE,kCAAkC;;AAOlC,kCAmQC;AAvQD,mCAA0D;AAE1D,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,SAAgB,WAAW,CAAC,IAAoB,EAAE,UAAU,GAAG,CAAC;IAC9D,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,UAAU,GAAG,CAAC,IAAI,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,cAAc,UAAU,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACzE,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAE3B,mDAAmD;IACnD,MAAM,CAAC,GAAe,EAAE,CAAC;IACzB,MAAM,CAAC,GAAe,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED,gCAAgC;IAChC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,GAAG,MAAM;gBAAE,MAAM,GAAG,EAAE,CAAC;YAC7B,IAAI,EAAE,GAAG,MAAM;gBAAE,MAAM,GAAG,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBAC1B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAoCD,MAAM,OAAO,GAAG,CAAC,CAAM,EAAU,EAAE;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC;QACjD,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACrB,CAAC,CAAC;IACF,MAAM,YAAY,GAAG,CAAC,CAAM,EAAO,EAAE;QACnC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACrD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACrD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QACrD,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IACrC,CAAC,CAAC;IAEF,oEAAoE;IACpE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAgB,EAAE,GAAG,EAAE,EAAc,EAAE,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,QAAQ,GAAU,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAQ,CAAC,CAAC;IAC5F,MAAM,WAAW,GAAU,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAQ,CAAC,CAAC;IAE/F,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAgB,EAAE,GAAG,EAAE,EAAc,EAAE,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,QAAQ,GAAU,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAQ,CAAC,CAAC;IAC5F,MAAM,WAAW,GAAU,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAQ,CAAC,CAAC;IAE/F,mEAAmE;IACnE,iEAAiE;IACjE,iEAAiE;IACjE,4DAA4D;IAC5D,SAAS,OAAO,CAAC,GAAgB,EAAE,KAAU;QAC3C,MAAM,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;QAC1D,MAAM,KAAK,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;QAEjD,mCAAmC;QACnC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrD,GAAG,GAAG,CAAC,CAAC;gBACR,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,GAAG,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAEzB,uDAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,IAAI,SAAS,GAAG,QAAQ,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,IAAI,IAAI,GAAG;gBAAE,SAAS;YAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAC9B,IAAI,KAAK,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;gBAC5B,SAAS,GAAG,KAAK,CAAC;gBAClB,OAAO,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,IAAI,OAAO,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,YAAY;QAE1C,uCAAuC;QACvC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACtE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,OAAO;gBAAE,SAAS;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAC/B,KAAK,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QACxB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uEAAuE;IACvE,8DAA8D;IAC9D,IAAI,QAAa,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACnB,QAAQ,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,iBAAiB;IAC9D,CAAC;SAAM,CAAC;QACN,QAAQ,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB;IACpE,CAAC;IAED,mEAAmE;IACnE,wDAAwD;IACxD,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAC3C,IAAI,aAAa,GAAgB,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACnE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QACjD,IAAI,OAAO,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,CAAC,gCAAgC;QACnE,uEAAuE;QACvE,qCAAqC;QACrC,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,UAAU;YAAE,MAAM;QAC3C,yEAAyE;QACzE,yBAAyB;QACzB,QAAQ,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACjC,aAAa,GAAG,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACzE,qEAAqE;QACrE,uEAAuE;QACvE,iCAAiC;QACjC,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;YAC3B,mEAAmE;YACnE,mEAAmE;YACnE,6BAA6B;YAC7B,aAAa,GAAG,IAAI,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,aAAa,GAAG,IAAI,CAAC;QACvB,CAAC;QACD,uEAAuE;QACvE,YAAY;QACZ,MAAM,YAAY,GAAG,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;QACxE,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC3D,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,aAAa,GAAG,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACvD,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;IACrD,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;IACrD,CAAC;IAED,oEAAoE;IACpE,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAE1C,8CAA8C;IAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAEpC,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEzE,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,OAAO,GAAG;QACd,IAAA,uCAA+B,EAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;QAC/C,IAAA,uCAA+B,EAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;KAChD,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;IACjD,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;IACjD,MAAM,MAAM,GAAG,QAAQ,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,CAAC;IAChD,OAAO;QACL,UAAU,EAAE;YACV,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE;YAC9B,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE;SAC/B;QACD,OAAO;QACP,MAAM;QACN,QAAQ,EAAE,KAAK;KAChB,CAAC;AACJ,CAAC"}

package/dist/game-theory/linalg.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Resuelve A x = b por eliminación gaussiana con pivot parcial.
+ * Devuelve null si el sistema es singular (no único o sin solución).
+ * Diseñado para matrices chicas (n ≤ 20).
+ */
+export declare function solveLinear(A: number[][], b: number[], tol?: number): number[] | null;
+//# sourceMappingURL=linalg.d.ts.map

package/dist/game-theory/linalg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linalg.d.ts","sourceRoot":"","sources":["../../src/game-theory/linalg.ts"],"names":[],"mappings":"AAMA;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,SAAQ,GAAG,MAAM,EAAE,GAAG,IAAI,CAmDpF"}

package/dist/game-theory/linalg.js

@@ -0,0 +1,69 @@
+"use strict";
+// ============================================================
+// Mini álgebra lineal (sin dependencias) — para resolver los
+// sistemas indiferentes del support enumeration y los pivots de
+// Lemke-Howson.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.solveLinear = solveLinear;
+/**
+ * Resuelve A x = b por eliminación gaussiana con pivot parcial.
+ * Devuelve null si el sistema es singular (no único o sin solución).
+ * Diseñado para matrices chicas (n ≤ 20).
+ */
+function solveLinear(A, b, tol = 1e-10) {
+    const n = A.length;
+    if (n === 0)
+        return [];
+    for (const row of A) {
+        if (row.length !== n)
+            throw new Error('solveLinear: matrix must be square');
+    }
+    if (b.length !== n)
+        throw new Error('solveLinear: b length mismatch');
+    // Matriz aumentada
+    const M = A.map((row, i) => {
+        const r = row.slice();
+        r.push(b[i]);
+        return r;
+    });
+    for (let col = 0; col < n; col++) {
+        // pivot parcial
+        let pivotRow = col;
+        let pivotVal = Math.abs(M[col][col]);
+        for (let r = col + 1; r < n; r++) {
+            const v = Math.abs(M[r][col]);
+            if (v > pivotVal) {
+                pivotVal = v;
+                pivotRow = r;
+            }
+        }
+        if (pivotVal < tol)
+            return null; // singular
+        if (pivotRow !== col) {
+            const tmp = M[col];
+            M[col] = M[pivotRow];
+            M[pivotRow] = tmp;
+        }
+        const pivot = M[col][col];
+        const pivRow = M[col];
+        for (let r = 0; r < n; r++) {
+            if (r === col)
+                continue;
+            const rowR = M[r];
+            const factor = rowR[col] / pivot;
+            if (factor === 0)
+                continue;
+            for (let c = col; c <= n; c++) {
+                rowR[c] = rowR[c] - factor * pivRow[c];
+            }
+        }
+    }
+    const x = new Array(n);
+    for (let i = 0; i < n; i++) {
+        const row = M[i];
+        x[i] = row[n] / row[i];
+    }
+    return x;
+}
+//# sourceMappingURL=linalg.js.map

package/dist/game-theory/linalg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linalg.js","sourceRoot":"","sources":["../../src/game-theory/linalg.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6DAA6D;AAC7D,gEAAgE;AAChE,gBAAgB;AAChB,+DAA+D;;AAO/D,kCAmDC;AAxDD;;;;GAIG;AACH,SAAgB,WAAW,CAAC,CAAa,EAAE,CAAW,EAAE,GAAG,GAAG,KAAK;IACjE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvB,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC9E,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IAEtE,mBAAmB;IACnB,MAAM,CAAC,GAAe,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACb,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACjC,gBAAgB;QAChB,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;gBACjB,QAAQ,GAAG,CAAC,CAAC;gBACb,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC,CAAC,WAAW;QAC5C,IAAI,QAAQ,KAAK,GAAG,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YACrB,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;QACpB,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG;gBAAE,SAAS;YACxB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACjC,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/game-theory/pure-nash.d.ts

@@ -0,0 +1,3 @@
+import type { NashEquilibrium, NormalFormGame } from './types';
+export declare function findPureNash(game: NormalFormGame): NashEquilibrium[];
+//# sourceMappingURL=pure-nash.d.ts.map

package/dist/game-theory/pure-nash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pure-nash.d.ts","sourceRoot":"","sources":["../../src/game-theory/pure-nash.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAS/D,wBAAgB,YAAY,CAAC,IAAI,EAAE,cAAc,GAAG,eAAe,EAAE,CAYpE"}

package/dist/game-theory/pure-nash.js

@@ -0,0 +1,86 @@
+"use strict";
+// ============================================================
+// Pure-strategy Nash equilibria
+// ============================================================
+//
+// Un perfil puro (s_1, ..., s_n) es Nash sii cada s_i es best
+// response del jugador i contra (s_{-i}). Lo verificamos
+// enumerando todos los perfiles y comprobando la condición.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findPureNash = findPureNash;
+const types_1 = require("./types");
+function findPureNash(game) {
+    const sizes = game.strategies;
+    const total = (0, types_1.totalProfiles)(sizes);
+    const equilibria = [];
+    for (let idx = 0; idx < total; idx++) {
+        const profile = (0, types_1.indexToProfile)(idx, sizes);
+        if (isProfileNash(game, profile)) {
+            equilibria.push(buildPureEquilibrium(game, profile));
+        }
+    }
+    return equilibria;
+}
+function isProfileNash(game, profile) {
+    const sizes = game.strategies;
+    for (let p = 0; p < game.players; p++) {
+        const mySize = sizes[p];
+        const baseIdx = (0, types_1.profileToIndex)(profile, sizes);
+        const row = game.payoffs[p];
+        if (!row)
+            throw new Error(`payoff missing for player ${p}`);
+        const curU = row[baseIdx];
+        for (let alt = 0; alt < mySize; alt++) {
+            if (alt === profile[p])
+                continue;
+            const altProfile = profile.slice();
+            altProfile[p] = alt;
+            const altIdx = (0, types_1.profileToIndex)(altProfile, sizes);
+            const altU = row[altIdx];
+            if (altU > curU + 1e-12)
+                return false;
+        }
+    }
+    return true;
+}
+function isStrictPureNash(game, profile) {
+    const sizes = game.strategies;
+    for (let p = 0; p < game.players; p++) {
+        const mySize = sizes[p];
+        const baseIdx = (0, types_1.profileToIndex)(profile, sizes);
+        const row = game.payoffs[p];
+        if (!row)
+            throw new Error(`payoff missing for player ${p}`);
+        const curU = row[baseIdx];
+        for (let alt = 0; alt < mySize; alt++) {
+            if (alt === profile[p])
+                continue;
+            const altProfile = profile.slice();
+            altProfile[p] = alt;
+            const altIdx = (0, types_1.profileToIndex)(altProfile, sizes);
+            const altU = row[altIdx];
+            if (altU >= curU - 1e-12)
+                return false;
+        }
+    }
+    return true;
+}
+function buildPureEquilibrium(game, profile) {
+    const sizes = game.strategies;
+    const strategies = profile.map((s, p) => ({
+        player: p,
+        distribution: (0, types_1.pureDistribution)(s, sizes[p]),
+    }));
+    const dists = strategies.map((s) => s.distribution);
+    const payoffs = new Array(game.players);
+    for (let p = 0; p < game.players; p++) {
+        payoffs[p] = (0, types_1.expectedPayoffFromDistributions)(game, p, dists);
+    }
+    return {
+        strategies,
+        payoffs,
+        isPure: true,
+        isStrict: isStrictPureNash(game, profile),
+    };
+}
+//# sourceMappingURL=pure-nash.js.map

package/dist/game-theory/pure-nash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pure-nash.js","sourceRoot":"","sources":["../../src/game-theory/pure-nash.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,yDAAyD;AACzD,4DAA4D;;AAW5D,oCAYC;AApBD,mCAMiB;AAEjB,SAAgB,YAAY,CAAC,IAAoB;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAA,qBAAa,EAAC,KAAK,CAAC,CAAC;IACnC,MAAM,UAAU,GAAsB,EAAE,CAAC;IAEzC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAA,sBAAc,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACjC,UAAU,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,aAAa,CAAC,IAAoB,EAAE,OAAiB;IAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,OAAO,GAAG,IAAA,sBAAc,EAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,EAAE,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YACnC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACpB,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;YACzB,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;gBAAE,OAAO,KAAK,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAoB,EAAE,OAAiB;IAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,OAAO,GAAG,IAAA,sBAAc,EAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,EAAE,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YACnC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACpB,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,GAAG,KAAK;gBAAE,OAAO,KAAK,CAAC;QACzC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAoB,EAAE,OAAiB;IACnE,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,EAAE,CAAC;QACT,YAAY,EAAE,IAAA,wBAAgB,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;KAC5C,CAAC,CAAC,CAAC;IACJ,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,OAAO,CAAC,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAA,uCAA+B,EAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO;QACL,UAAU;QACV,OAAO;QACP,MAAM,EAAE,IAAI;QACZ,QAAQ,EAAE,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC;KAC1C,CAAC;AACJ,CAAC"}

package/dist/game-theory/support-enumeration.d.ts

@@ -0,0 +1,3 @@
+import type { NashEquilibrium, NormalFormGame } from './types';
+export declare function enumerateAllNash(game: NormalFormGame, maxSize?: number): NashEquilibrium[];
+//# sourceMappingURL=support-enumeration.d.ts.map

package/dist/game-theory/support-enumeration.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"support-enumeration.d.ts","sourceRoot":"","sources":["../../src/game-theory/support-enumeration.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAM/D,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,eAAe,EAAE,CA8B1F"}