Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, wi
Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.
5000 (raw units)
price
2
calls / 30d
1
unique payers
2026-09-15
updated
Provider
decision-solver.use.x402atlas.com · discovered, not yet claimed by its owner
Payment (x402 accepts[])
[
{
"scheme": "exact",
"network": "eip155:8453",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"amount": "5000",
"maxTimeoutSeconds": 300
},
{
"scheme": "exact",
"network": "eip155:137",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"amount": "5000",
"maxTimeoutSeconds": 300
},
{
"scheme": "exact",
"network": "eip155:42161",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"amount": "5000",
"maxTimeoutSeconds": 300
}
]Output schema
{
"bazaar": {
"category": "utilities",
"info": {
"input": {
"body": {
"costs": [
[
4,
1,
3
],
[
2,
0,
5
],
[
3,
2,
2
]
]
},
"bodyType": "json",
"method": "POST",
"type": "http"
},
"output": {
"example": {
"algorithm_version": "hungarian-min-v1",
"certificate": {
"column_potentials": [
0,
-2,
0
],
"padded_assignment": [
1,
0,
2
],
"row_potentials": [
3,
2,
2
]
},
"objective": "minimum_total_cost",
"objective_value": 5,
"operation": "assignment",
"optimal": true,
"solution": {
"assignments": [
{
"cost": 1,
"task_index": 1,
"worker_index": 0
},
{
"cost": 2,
"task_index": 0,
"worker_index": 1
},
{
"cost": 2,
"task_index": 2,
"worker_index": 2
}
]
},
"warnings": [],
"work_units": 24
},
"type": "json"
}
},
"schema": {
"$schema": "https://json-schema.org/draft/2020-12/schema",
"properties": {
"input": {
"additionalProperties": false,
"properties": {
"body": {
"additionalProperties": false,
"properties": {
"costs": {
"description": "Rectangular worker-by-task cost matrix; workers <= tasks and each worker receives one distinct task",
"items": {
"description": "One worker's signed integer costs in task-index order; every row must have the same length",
"items": {
"description": "Cost of assigning this worker to this task",
"maximum": 1000000000,
"minimum": -1000000000,
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"costs"
],
"type": "object"
},
"bodyType": {
"enum": [
"json",
"form-data",
"text"
],
"type": "string"
},
"method": {
"enum": [
"POST"
],
"type": "string"
},
"type": {
"const": "http",
"type": "string"
}
},
"required": [
"type",
"method",
"bodyType",
"body"
],
"type": "object"
},
"output": {
"properties": {
"example": {
"additionalProperties": false,
"properties": {
"_atlas": {
"additionalProperties": false,
"description": "Atlas documentation and related-route metadata added after deployment",
"properties": {
"docs": {
"description": "Documentation URL for this bridge",
"format": "uri",
"maxLength": 512,
"type": "string"
},
"related": {
"description": "Bounded related Atlas routes",
"items": {
"additionalProperties": false,
"description": "One related Atlas route",
"properties": {
"bridge": {
"description": "Related bridge name",
"maxLength": 64,
"type": "string"
},
"docs": {
"description": "Related bridge documentation URL",
"format": "uri",
"maxLength": 512,
"type": "string"
},
"summary": {
"description": "Short capability summary",
"maxLength": 256,
"type": "string"
},
"url": {
"description": "Related route URL",
"format": "uri",
"maxLength": 512,
"type": "string"
}
},
"required": [
"bridge",
"url",
"docs",
"summary"
],
"type": "object"
},
"maxItems": 3,
"type": "array"
}
},
"required": [
"docs"
],
"type": "object"
},
"algorithm_version": {
"const": "hungarian-min-v1",
"description": "Pinned deterministic algorithm and certificate contract",
"type": "string"
},
"certificate": {
"additionalProperties": false,
"description": "Independently checkable primal/dual certificate for the padded square matrix",
"properties": {
"column_potentials": {
"description": "Signed column dual potentials",
"items": {
"description": "Signed dual potential value",
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"padded_assignment": {
"description": "Task index matched to each padded worker",
"items": {
"description": "Zero-based padded task index",
"maximum": 63,
"minimum": 0,
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"row_potentials": {
"description": "Signed row dual potentials",
"items": {
"description": "Signed dual potential value",
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"padded_assignment",
"row_potentials",
"column_potentials"
],
"type": "object"
},
"objective": {
"const": "minimum_total_cost",
"description": "The solver minimizes the sum of selected assignment costs",
"type": "string"
},
"objective_value": {
"description": "Proven minimum total cost",
"maximum": 64000000000,
"minimum": -64000000000,
"type": "integer"
},
"operation": {
"const": "assignment",
"description": "Stable route operation name",
"type": "string"
},
"optimal": {
"const": true,
"description": "True because the primal/dual certificate proves this exact optimum",
"type": "boolean"
},
"solution": {
"additionalProperties": false,
"description": "Customer assignment excluding padded dummy workers",
"properties": {
"assignments": {
"description": "Exactly one assignment per input worker, ordered by worker index",
"items": {
"additionalProperties": false,
"description": "One chosen worker-to-task edge",
"properties": {
"cost": {
"description": "Input cost on the chosen edge",
"maximum": 1000000000,
"minimum": -1000000000,
"type": "integer"
},
"task_index": {
"description": "Zero-based input task index",
"maximum": 63,
"minimum": 0,
"type": "integer"
},
"worker_index": {
"description": "Zero-based input worker index",
"maximum": 63,
"minimum": 0,
"type": "integer"
}
},
"required": [
"worker_index",
"task_index",
"cost"
],
"type": "object"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"assignments"
],
"type": "object"
},
"warnings": {
"description": "Always empty for this exact solver",
"items": {
"description": "Human-readable warning",
"type": "string"
},
"maxItems": 0,
"type": "array"
},
"work_units": {
"description": "Counted Hungarian inner comparisons",
"maximum": 262144,
"minimum": 0,
"type": "integer"
}
},
"required": [
"operation",
"algorithm_version",
"objective",
"objective_value",
"optimal",
"solution",
"work_units",
"certificate",
"warnings"
],
"type": "object"
},
"type": {
"type": "string"
}
},
"required": [
"type"
],
"type": "object"
}
},
"required": [
"input"
],
"type": "object"
},
"tags": [
"assignment-solver",
"optimization",
"operations-research",
"bounded-computation",
"deterministic"
]
}
}Use it
curl
curl "https://decision-solver.use.x402atlas.com/assignment" # -> 402 Payment Required, accepts[] lists how to pay # retry with a PAYMENT-SIGNATURE (or PAYMENT header) once paid
JavaScript
const res = await fetch("https://decision-solver.use.x402atlas.com/assignment");
if (res.status === 402) {
const { accepts } = await res.json();
// pay one of accepts[] via an x402 client, then retry with the payment header
}Python
import httpx
res = httpx.get("https://decision-solver.use.x402atlas.com/assignment")
if res.status_code == 402:
accepts = res.json()["accepts"]
# pay one of accepts[] via an x402 client, then retry with the payment headerMachine-readable
Everything on this page is also available as clean JSON at /resources/3465.json, and this resource appears in /discovery/resources and /discovery/search.