Pages that link to "Item:Q2580967"
From MaRDI portal
The following pages link to Procedurally fair and stable matching (Q2580967):
Displaying 22 items.
- An alternative characterization of top trading cycles (Q372362) (← links)
- Two simple variations of top trading cycles (Q496872) (← links)
- Fractional matching markets (Q516999) (← links)
- Sequential entry in many-to-one matching markets (Q734048) (← links)
- Equitable selection in bilateral matching markets (Q816105) (← links)
- Arbitrated matching: Formulation and protocol (Q1266604) (← links)
- On two kinds of manipulation for school choice problems (Q1762420) (← links)
- A feasibility evaluation of fair and privacy-enhanced matchmaking with identity linked wishes (Q2014647) (← links)
- Stability and median rationalizability for aggregate matchings (Q2052526) (← links)
- All probabilities are equal, but some probabilities are more equal than others (Q2088610) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Fairness and utilitarianism without independence (Q2323582) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- A computational approach to modeling commodity markets (Q2461658) (← links)
- Median stable matching for college admissions (Q2491093) (← links)
- On the stable matchings that can be reached when the agents go marching in one by one (Q2832573) (← links)
- EMPLOYMENT BY LOTTO REVISITED (Q3402027) (← links)
- Deferred Acceptance with Compensation Chains (Q4994168) (← links)
- An extendable stable matching algorithm of a kind of bipartite graph (Q5069846) (← links)
- The Generalized Median Stable Matchings: Finding Them Is Not That Easy (Q5458560) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- A fair procedure in a marriage market (Q6641268) (← links)
