Pages that link to "Item:Q3596716"
From MaRDI portal
The following pages link to The Complexity of Rationalizing Matchings (Q3596716):
Displaying 8 items.
- Complexity of matching problems (Q1099615) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Testable implications of general equilibrium models: an integer programming approach (Q2427857) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- What Matchings Can Be Stable? The Testable Implications of Matching Theory (Q3168993) (← links)
- Inverse Game Theory: Learning Utilities in Succinct Games (Q3460806) (← links)
- More Efficient Match-Making and Satisfiability The Five Card Trick (Q5110898) (← links)
- Empirical content of classic assignment methods: jungle and market economy (Q6063089) (← links)