Size versus truncation robustness in the assignment problem
type: Item
instance of: scholarly article
title: Size versus truncation robustness in the assignment problem
zbMATH Open document ID: 1436.91089
author: Shunya Noda
published in: Journal of Mathematical Economics
publication date: 2020-04-07T00:00:00Z
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 7187726
zbMATH Keywords: random assignment
zbMATH Keywords: random mechanism
zbMATH Keywords: maximum matching
zbMATH Keywords: strategy-proofness
zbMATH Keywords: weak truncation robustness
MaRDI profile type: Publication
full work available at URL: j.jmateco.2019.12.001
OpenAlex ID: W2890695238
cites work: A new solution to the random assignment problem.
cites work: Random Matching Under Dichotomous Preferences
cites work: Size versus fairness in the assignment problem
cites work: Strategy-proof stochastic assignment
cites work: College Admissions and the Stability of Marriage
cites work: Two axiomatic approaches to the probabilistic serial mechanism
cites work: Kidney Exchange
cites work: On cores and indivisibility
DOI: 10.1016/J.JMATECO.2019.12.001
Recommended article: Corrigendum to: ``Size versus truncation robustness in the assignment problem''
Recommended article: Size versus fairness in the assignment problem
Recommended article: AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM
Recommended article: Robust multivalued solutions for assignment problems: A note
Recommended article: A robust heuristic for the generalized assignment problem
Recommended article: Paths to stability in the assignment problem
Recommended article: Q4311913
Recommended article: A note on robustness tolerances for combinatorial optimization problems
Recommended article: Q2932929
Recommended article: Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
description: scientific article; zbMATH DE number 7187726