The Complexity of Rationalizing Matchings
From MaRDI portal
Publication:3596716
DOI10.1007/978-3-540-92182-0_18zbMath1183.68311MaRDI QIDQ3596716
Christopher Umans, Shankar Kalyanaraman
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20191127-084809601
68Q25: Analysis of algorithms and problem complexity
68W25: Approximation algorithms
91B68: Matching models
Related Items
Empirical content of classic assignment methods: jungle and market economy, The computational complexity of rationalizing boundedly rational choice behavior, Testable implications of general equilibrium models: an integer programming approach, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms, Inverse Game Theory: Learning Utilities in Succinct Games