23 citations · 45 across the 17 of their papers we have counts for
6 papers · 1 filter
The Inversion Paradox and Ranking Methods in Tournaments
Guillaume Chéze, Etienne Fieux
This article deals with ranking methods. We study the situation where a tournament between players , , \ldots gives the ranking $P_1 \succ P_2 \succ \cdots \suc…
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…
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.
Topological aggregation, the twin paradox and the no show paradox
Guillaume Chèze
Consider the framework of topological aggregation introduced by Chichilnisky (1980). We prove that in this framework the Twin Paradox and the No Show Paradox cannot be avoided. Ano…