SOURCE-LINKED INTELLIGENCE

Multi-Dimensional Matching

arXiv · AI, language, vision and robotics · article · Sep 24, 2026 · UTC

We study a matching mechanism where agents and objects are described by features rather than complete rankings. A single spectral projection reduces the problem to a one-dimensional sort, computable in O(N log N) time. We prove that on descaled features and preferences, our algorithm obtains the exact Nash Social Welfare (NSW) optimum within the projected space, with an unconditional utilitarian-welfare guarantee and a conditional NSW guarantee. The proposed mechanism is stable against exogenous noise but not strategy-proof; we provide an explicit profitable misreport. On an agentic AI shoppin

Read original source ↗ Open in workspace

recordType

paper

region

Global