A solution to the random assignment problem on the full preference domain (Q860356)
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: A solution to the random assignment problem on the full preference domain |
scientific article; zbMATH DE number 5083116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution to the random assignment problem on the full preference domain |
scientific article; zbMATH DE number 5083116 |
Statements
A solution to the random assignment problem on the full preference domain (English)
0 references
9 January 2007
0 references
assignment
0 references
randomization
0 references
indifferences
0 references
ordinal efficiency
0 references
fairness
0 references
envy-freeness
0 references
strategy-proofness
0 references
maximum flows
0 references
0 references
