The marriage proposals problem: fair and efficient solution for two-party computations
From MaRDI portal
Recommendations
- Efficiency and stability of probabilistic assignments in marriage problems
- An Efficient Protocol for Fair Secure Two-Party Computation
- Randomized approximation of the stable marriage problem
- Randomized approximation of the stable marriage problem
- Algorithmic aspects of equilibria of stable marriage model with complete preference lists
- Efficiently making secure two-party computation fair
- Complete fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Approximation algorithms for the sex-equal stable marriage problem
- Approximation Algorithms for the Sex-Equal Stable Marriage Problem
Cited in
(2)
This page was built for publication: The marriage proposals problem: fair and efficient solution for two-party computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712208)