How to cut a cake with a gram matrix

07/07/2017
by   Guillaume Chèze, et al.
0

In this article we study the problem of fair division. In particular we study a notion introduced by J. Barbanel that generalizes super envy-free fair division. We give a new proof of his result. Our approach allows us to give an explicit bound for this kind of fair division. Furthermore, we also give a theoretical answer to an open problem posed by Barbanel in 1996. Roughly speaking, this question is: how can we decide if there exists a fair division satisfying some inequalities constraints? Furthermore, when all the measures are given with piecewise constant density functions then we show how to construct effectively such a fair division.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2018

Don't cry to be the first! Symmetric fair division algorithms exist

In this article we study a cake cutting problem. More precisely, we stud...
research
10/16/2018

How to share a cake with a secret agent

In this note we study a problem of fair division in the absence of full ...
research
06/07/2022

Comparative study in fair division algorithms

A comparison of four fair division algorithms performed on real data fro...
research
01/13/2022

How to make the toss fair in cricket?

In the sport of cricket, the side that wins the toss and has the first c...
research
02/22/2018

A Cut-And-Choose Mechanism to Prevent Gerrymandering

We present a novel mechanism to endogenously choose a fair division of a...
research
07/11/2019

Estimating the division rate from indirect measurements of single cells

Is it possible to estimate the dependence of a growing and dividing popu...
research
06/28/2019

Cake cutting: Explicit examples for impossibility results

In this article we suggest a model of computation for the cake cutting p...

Please sign up or login with your details

Forgot password? Click here to reset