Size versus truncation robustness in the assignment problem
From MaRDI portal
Recommendations
- Corrigendum to: ``Size versus truncation robustness in the assignment problem
- Size versus fairness in the assignment problem
- An improved reduction method for the robust optimization of the assignment problem
- Robust multivalued solutions for assignment problems: A note
- A robust heuristic for the generalized assignment problem
- Paths to stability in the assignment problem
- scientific article; zbMATH DE number 679866
- A note on robustness tolerances for combinatorial optimization problems
- On the robustness of optimal solutions for combinatorial optimization problems
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
Cites work
- A new solution to the random assignment problem.
- College Admissions and the Stability of Marriage
- Kidney Exchange
- On cores and indivisibility
- Random Matching Under Dichotomous Preferences
- Size versus fairness in the assignment problem
- Strategy-proof stochastic assignment
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(6)- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- Matroid and knapsack house allocation
- Size versus fairness in the assignment problem
- Tight social welfare approximation of probabilistic serial
This page was built for publication: Size versus truncation robustness in the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985723)
