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 the normal view instead:
scientific article; zbMATH DE number 5083116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9230679273605348
0 references
0.8924874067306519
0 references
0.8909328579902649
0 references
0.886778712272644
0 references
0.8778210282325745
0 references
