The Complexity of Rationalizing Matchings

DOI10.1007/978-3-540-92182-0_18MaRDI QIDQ3596716zbMATH OpenOpenAlexFDO

Authors Shankar Kalyanaraman, Christopher Umans

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Matching models (91B68)

Recommendations

• scientific article; zbMATH DE number 3921983
• Complexity of matching problems
• Simultaneous matchings: Hardness and approximation
• The complexity of matching with bonds
• Computational complexity of simultaneous elementary matching problems
• Computational complexity of simultaneous elementary matching problems
• On the complexity of a family of generalized matching problems
• The complexity of matching games: a survey
• The complexity of approximately counting stable matchings
• The Complexity of Approximately Counting Stable Matchings

Cited in

(11)

• Complexity of matching problems
• 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
• What matchings can be stable? The testable implications of matching theory
• Testing consumer rationality using perfect graphs and oriented discs
• Inverse game theory: learning utilities in succinct games
• More Efficient Match-Making and Satisfiability The Five Card Trick
• The complexity of rationalizing network formation
• On the revealed preference analysis of stable aggregate matchings
• Empirical content of classic assignment methods: jungle and market economy

This page was built for publication: The Complexity of Rationalizing Matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596716)