An aggregate NTU stability concept using one-sided money burning decentralizes stable matchings in type-based markets and extends to a random utility model with proven existence, uniqueness, and convergent algorithm.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A dynamic programming algorithm solves the column generation subproblem to enable efficient estimation of single- and multi-purchase ranked list choice models.
citing papers explorer
-
Aggregate Stable Matching with Money Burning
An aggregate NTU stability concept using one-sided money burning decentralizes stable matchings in type-based markets and extends to a random utility model with proven existence, uniqueness, and convergent algorithm.
-
Modern column generation for estimating single- and multi-purchase ranked list choice models
A dynamic programming algorithm solves the column generation subproblem to enable efficient estimation of single- and multi-purchase ranked list choice models.