Skip to content
HALOWERK

Datenvertragswerk

assignment game core extremes

For a square1..3 by1..3 nonnegative integer surplus matrix with entries0..6, compute the maximum transferable assignment surplus, a lexicographically first optimal perfect assignment, and both extreme core utility vectors. Every buyer receives their largest simultaneous core payoff in buyer_optimal; every seller receives theirs in seller_optimal. Return all exact dual slacks u_i+v_j-a_ij for each extreme. Nonnegative payoffs sum to optimal surplus; all slacks nonnegative and assigned edges.

POST https://datenvertrag.halowerk.com/v1/assignment-game-core-extremes

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
surplusSee schemaYes
claim_surplusSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "surplus": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "array",
            "items": {
              "type": "integer",
              "minimum": 0,
              "maximum": 6
            },
            "minItems": 1,
            "maxItems": 3
          },
          "minItems": 1,
          "maxItems": 3
        },
        {
          "type": "null"
        }
      ]
    },
    "claim_surplus": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 18
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "surplus",
    "claim_surplus"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "surplus": [
    [
      5,
      1
    ],
    [
      2,
      4
    ]
  ],
  "claim_surplus": 9
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’