2 citations · 4 across the 3 of their papers we have counts for
7 papers
Cake cutting: Explicit examples for impossibility results
Guillaume Chèze
In this article we suggest a model of computation for the cake cutting problem. In this model the mediator can ask the same queries as in the Robertson-Webb model but he or she can…
How to share a cake with a secret agent
Guillaume Chèze
In this note we study a problem of fair division in the absence of full information. We give an algorithm which solves the following problem: n 2 persons want to cut a cake i…
Don't cry to be the first!Symmetric fair division exist
Guillaume Chèze
In this article we study a cake cutting problem. More precisely, we study symmetric fair division algorithms, that is to say we study algorithms where the order of the players do n…
How to cut a cake with a gram matrix
Guillaume Chèze, Luca Amodei
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…
Existence of a simple and equitable fair division: a short proof
Guillaume Chèze
In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions.
Darboux theory of integrability in the sparse case
Guillaume Chèze
Darboux's theorem and Jouanolou's theorem deal with the existence of first integrals and rational first integrals of a polynomial vector field. These results are given in terms of…