When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When is the probabilistic serial assignment uniquely efficient and envy-free? |
scientific article |
Statements
When is the probabilistic serial assignment uniquely efficient and envy-free? (English)
0 references
16 January 2017
0 references
probabilistic serial assignment
0 references
sd-efficiency
0 references
sd-no-envy
0 references
top-objects divisibility
0 references
preference richness
0 references
recursive decomposability
0 references
0 references
