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-extremesInputs
| Field | Type | Required | Description |
|---|---|---|---|
| surplus | See schema | Yes | |
| claim_surplus | See schema | Yes |
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
}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
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.