A neural menu-generation framework produces strategy-proof assignments in constrained matching markets by trading off envy and waste through differentiable optimization.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2026 2representative citing papers
ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.
citing papers explorer
-
MenuNet: A Strategy-Proof Mechanism for Matching Markets
A neural menu-generation framework produces strategy-proof assignments in constrained matching markets by trading off envy and waste through differentiable optimization.
-
Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.