Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization |
scientific article; zbMATH DE number 6359755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization |
scientific article; zbMATH DE number 6359755 |
Statements
Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (English)
0 references
22 October 2014
0 references
generalized serial rule
0 references
sd-efficiency
0 references
sd proportional-division lower-bound
0 references
sd normalized-no-envy
0 references
limited invariance
0 references
consistency
0 references
0 references
0.87338156
0 references
0.87258345
0 references
0.87140334
0 references
0.87001324
0 references
0.8610753
0 references
0.85947436
0 references
0.8569104
0 references
0.85436493
0 references
0.84879255
0 references
