A solution to the random assignment problem on the full preference domain (Q860356): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jet/KattaS06, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jet/KattaS06 / rank | |||
Normal rank | |||
Revision as of 06:37, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution to the random assignment problem on the full preference domain |
scientific article |
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
