Fair division of graphs and of tangled cakes (Q6120940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Connectivity in Fair Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost envy-free allocations with connected bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A moving-knife solution to the four-person envy-free cake-division problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut a Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rental Harmony: Sperner's Lemma in Fair Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximin Share Allocations on Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Separable and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a cake fairly / rank
 
Normal rank

Revision as of 11:28, 27 August 2024

scientific article; zbMATH DE number 7807881
Language Label Description Also known as
English
Fair division of graphs and of tangled cakes
scientific article; zbMATH DE number 7807881

    Statements

    Identifiers