Maximin share and minimax envy in fair-division problems. (Q1399324)
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 1956866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximin share and minimax envy in fair-division problems. |
scientific article; zbMATH DE number 1956866 |
Statements
Maximin share and minimax envy in fair-division problems. (English)
0 references
30 July 2003
0 references
Fair-division
0 references
cake-cutting
0 references
maximin share
0 references
minimax envy
0 references
envy-free
0 references
optimal
0 references
partition
0 references
equitable partition
0 references
0 references
0.8313004374504089
0 references
0.8311544060707092
0 references
0.8280625939369202
0 references
