A note on envy-free cake cutting with polynomial valuations (Q477590)
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: A note on envy-free cake cutting with polynomial valuations |
scientific article; zbMATH DE number 6378633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on envy-free cake cutting with polynomial valuations |
scientific article; zbMATH DE number 6378633 |
Statements
A note on envy-free cake cutting with polynomial valuations (English)
0 references
9 December 2014
0 references
algorithms
0 references
cake cutting
0 references
query complexity
0 references
envy-freeness
0 references
0.8650459051132202
0 references
0.838433027267456
0 references
0.8327251672744751
0 references
0.8229584693908691
0 references
0.8222443461418152
0 references
