econ.EMSep 24, 2026

Multi-Dimensional Matching

Authors: Irene Aldridge

Abstract

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 shopping application, the diagnostics correctly anticipate both a success and a failure case. A 100-instance robustness study confirms the findings.

Figures & tables

Explore similar work

CardsList
  1. Learn to Match: Two-Sided Matching with Temporally Extended Feedback

    Jun 4, 2026Haijing Zong, Yancheng Liang, Boyang Zhou +1Distribution MatchingMatching Markets

  2. Probably Correct Optimal Stable Matching under Two-Sided Uncertainty

    Jul 6, 2026Andreas Athanasopoulos, Anne-Marie George, Christos DimitrakakisDistribution MatchingMatching Markets