How to allocate hard candies fairly (Q2463574)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	How to allocate hard candies fairly	scientific article

Statements

scholarly article

0 references

How to allocate hard candies fairly (English)

0 references

0 references

Marco Dall'Aglio

0 references

Mathematical Social Sciences

0 references

publication date

14 December 2007

0 references

zbMATH Keywords

fair division

0 references

indivisible items

0 references

adjusted winner

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.mathsocsci.2007.04.008

0 references

Vilfredo Pareto cuts the cake

0 references

Fair division of indivisible items

0 references

Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity

0 references

0 references

0 references

0 references

Equitable distribution of indivisible objects

0 references

A simple procedure for finding equitable allocations of indivisible goods

0 references

Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods

0 references

0 references

0 references

0 references

Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.MATHSOCSCI.2007.04.008

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2463574

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2463574&oldid=39099758"