Maximin share and minimax envy in fair-division problems. (Q1399324): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:59, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximin share and minimax envy in fair-division problems. |
scientific article |
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
