Envy-free two-player \(m\)-cake and three-player two-cake divisions (Q2450739): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2013.07.010 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2013.07.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069333429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player envy-free multi-cake division / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polytopal generalization of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut A Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / 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 / DOI
 
Property / DOI: 10.1016/J.ORL.2013.07.010 / rank
 
Normal rank

Latest revision as of 17:25, 18 December 2024

scientific article
Language Label Description Also known as
English
Envy-free two-player \(m\)-cake and three-player two-cake divisions
scientific article

    Statements

    Envy-free two-player \(m\)-cake and three-player two-cake divisions (English)
    0 references
    0 references
    0 references
    0 references
    15 May 2014
    0 references
    fair division
    0 references
    envy-free
    0 references
    matching
    0 references
    \(m\)-partite hypergraph
    0 references
    polytope
    0 references
    Sperner's lemma
    0 references

    Identifiers