Two-stage stochastic stable matching

DOI10.1007/978-3-031-59835-7_12MaRDI QIDQ7030565zbMATH OpenFDO

Authors Yuri Faenza, Ayoub Foussoul, Chengyue He

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-59835-7_12

zbMATH Keywords

posetstable matchingtwo-stage stochastic programming

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites work

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• College Admissions and the Stability of Marriage
• Computational Complexity
• Finding independent sets in unions of perfect graphs
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 1099363 (Why is no real title available?)
• Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

Cited in

(1)

• Non-distributive lattices, stable matchings, and linear optimization

This page was built for publication: Two-stage stochastic stable matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030565)