HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts

Masoud Seddighin
Masoud Seddighin
Majid Farhadi
Majid Farhadi
Mohammad Ghodsi
Mohammad Ghodsi
Reza Alijani
Reza Alijani
Ahmad S. Tajik
Ahmad S. Tajik

Algorithmica, pp. 1-28, 2018.

Cited by: 0|Bibtex|Views11|DOI:https://doi.org/10.1007/s00453-018-0500-z
EI
Other Links: link.springer.com|academic.microsoft.com|dblp.uni-trier.de
Keywords:
Cake cuttingEnvy-freeMechanism designApproximationFairness

Abstract:

We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation ...More

Code:

Data:

Your rating :
0

 

Tags
Comments