Procedurally fair and stable matching
From MaRDI portal
Publication:2580967
Recommendations
- Fair matchings and related problems
- Fair matchings and related problems
- Algorithms for new types of fair stable matchings
- Stable matching with proportionality constraints
- On the existence of fair matching algorithms
- Stable matching and protocol-free equilibrium
- Fair-by-design matching
- On randomized matching mechanisms
- Random stable matchings
Cited in
(24)- Arbitrated matching: Formulation and protocol
- On two kinds of manipulation for school choice problems
- A feasibility evaluation of fair and privacy-enhanced matchmaking with identity linked wishes
- Stability and median rationalizability for aggregate matchings
- All probabilities are equal, but some probabilities are more equal than others
- Fair-by-design matching
- Fairness and utilitarianism without independence
- A computational approach to modeling commodity markets
- Median stable matching for college admissions
- On the stable matchings that can be reached when the agents go marching in one by one
- Employment by lotto revisited
- An alternative characterization of top trading cycles
- Two simple variations of top trading cycles
- Deferred acceptance with compensation chains
- An extendable stable matching algorithm of a kind of bipartite graph
- Fractional matching markets
- The Generalized Median Stable Matchings: Finding Them Is Not That Easy
- On colorful vertex and edge cover problems
- Socially fair matching: exact and approximation algorithms
- Proportionally Fair Matching with Multiple Groups
- A fair procedure in a marriage market
- Resolute and symmetric mechanisms for two-sided matching problems
- Sequential entry in many-to-one matching markets
- Equitable selection in bilateral matching markets
This page was built for publication: Procedurally fair and stable matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2580967)
