{"slug":"decision-solver-use-x402atlas-com-assignment-f2fde9","title":"Assignment solver — exact minimum-cost worker-to-task matching for resource allo","host":"decision-solver.use.x402atlas.com","method":"POST","resource":"https://decision-solver.use.x402atlas.com/assignment","category":"other","description":"Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.","price_listed":0.005,"price_asked":0.005,"state":"answering","state_label":"Answering","checks_7d":1,"answered_7d":1,"latency_ms_median":663,"reported_calls_30d":2,"reported_payers_30d":1,"networks":["eip155:137","eip155:42161","eip155:8453"],"badge":"unverified","paid_checks_7d":0,"paid_ok_7d":0,"example_input":{"body":{"costs":[[4,1,3],[2,0,5],[3,2,2]]},"bodyType":"json","method":"POST","type":"http"},"output_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"},"history":[{"day":"2026-09-24","reachable":true,"status":402,"valid_402":true,"asked_usdc":0.005,"price_match":true,"latency_ms":663,"error":null}],"description_full":"Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.","last_updated":"2026-09-15T06:32:25.274Z","schemes":["exact"]}