Procedurally fair and stable matching
From MaRDI portal
Publication:2580967
DOI10.1007/S00199-004-0602-5zbMath1102.91077OpenAlexW2105688526MaRDI QIDQ2580967
Publication date: 10 January 2006
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-004-0602-5
Related Items (18)
An extendable stable matching algorithm of a kind of bipartite graph ⋮ An alternative characterization of top trading cycles ⋮ On colorful vertex and edge cover problems ⋮ Socially fair matching: exact and approximation algorithms ⋮ The computational complexity of random serial dictatorship ⋮ A computational approach to modeling commodity markets ⋮ Two simple variations of top trading cycles ⋮ Fractional matching markets ⋮ On two kinds of manipulation for school choice problems ⋮ Median stable matching for college admissions ⋮ Proportionally Fair Matching with Multiple Groups ⋮ Sequential entry in many-to-one matching markets ⋮ The Generalized Median Stable Matchings: Finding Them Is Not That Easy ⋮ Stability and median rationalizability for aggregate matchings ⋮ On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One ⋮ EMPLOYMENT BY LOTTO REVISITED ⋮ Fairness and utilitarianism without independence ⋮ Deferred Acceptance with Compensation Chains
This page was built for publication: Procedurally fair and stable matching
