When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391)
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: When is the probabilistic serial assignment uniquely efficient and envy-free? |
scientific article; zbMATH DE number 6675066
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When is the probabilistic serial assignment uniquely efficient and envy-free? |
scientific article; zbMATH DE number 6675066 |
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
