The Complexity of Rationalizing Matchings

From MaRDI portal

Revision as of 03:33, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3596716

Jump to:navigation, search

DOI10.1007/978-3-540-92182-0_18zbMath1183.68311OpenAlexW85889939MaRDI 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

Mathematics Subject Classification ID

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

Related Items (5)

Inverse Game Theory: Learning Utilities in Succinct Games ⋮ Empirical content of classic assignment methods: jungle and market economy ⋮ Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms ⋮ The computational complexity of rationalizing boundedly rational choice behavior ⋮ Testable implications of general equilibrium models: an integer programming approach

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3596716&oldid=17011431"