A discrete and bounded envy-free cake cutting protocol for four agents (Q5361851)
From MaRDI portal
scientific article; zbMATH DE number 6784092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A discrete and bounded envy-free cake cutting protocol for four agents |
scientific article; zbMATH DE number 6784092 |
Statements
A discrete and bounded envy-free cake cutting protocol for four agents (English)
0 references
29 September 2017
0 references
cake cutting
0 references
elicitation protocols
0 references
fair division
0 references
multiagent resource allocation
0 references
