A note on envy-free cake cutting with polynomial valuations (Q477590)

From MaRDI portal
Revision as of 10:02, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on envy-free cake cutting with polynomial valuations
scientific article

    Statements

    A note on envy-free cake cutting with polynomial valuations (English)
    0 references
    0 references
    9 December 2014
    0 references
    algorithms
    0 references
    cake cutting
    0 references
    query complexity
    0 references
    envy-freeness
    0 references

    Identifiers