A note on envy-free cake cutting with polynomial valuations (Q477590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Envy-Free Cake Division Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cake cutting really is not a piece of cake / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut a Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cake cutting / rank
 
Normal rank

Latest revision as of 10:02, 9 July 2024

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