Stepwise ordinal efficiency for the random assignment problem (Q1996179): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jmateco.2020.10.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3097163956 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new solution to the random assignment problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The ``Boston'' school-choice mechanism: an axiomatic approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fairness and efficiency in strategy-proof object allocation mechanisms / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:46, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stepwise ordinal efficiency for the random assignment problem |
scientific article |
Statements
Stepwise ordinal efficiency for the random assignment problem (English)
0 references
3 March 2021
0 references
random assignment problem
0 references
stepwise ordinal efficiency
0 references
interim favoring ranks
0 references
ordinal efficiency
0 references
rank efficiency
0 references
eating algorithm
0 references
