Dividing connected chores fairly (Q500994): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q29540237 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1780118416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Envy-Free Cake Division Protocol / 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: The efficiency of fair division / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of equitable cake divisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Cut A Cake Fairly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-Person Envy-Free Chore Division / 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: Rental Harmony: Sperner's Lemma in Fair Division / rank
 
Normal rank

Latest revision as of 20:42, 10 July 2024

scientific article
Language Label Description Also known as
English
Dividing connected chores fairly
scientific article

    Statements

    Identifiers