It is often necessary to divide a certain amount of money between n participants, i.e., to assign, to each participant, a certain portion w i 0 of the whole sum (so that w1 + : : : + wn = 1). In some situations, from the fairness requirements, we can uniquely determine these "weights" w i . However, in some other situations, general considerations do not allow us to uniquely determine these weights, we only know the intervals [w \Gamma i ; w + i ] of possible fair weights. We show that natural fairness requirements enable us to choose unique weights from these intervals; as a result, we present an algorithm for fair division under interval uncertainty. 1 Introduction to the Problem The general problem of fair division. It i...
Fair division with unequal shares is an intensively studied resource allocation problem. For i ∈ [n...
We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanis...
Two or more players rank a set of indivisible items from best to worst. An efficient allocation of i...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, t...
In a recent paper [International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems 8:61...
We revisit the classic problem of fair division from a mechanism design perspective, using Proportio...
International audienceIn this article we study the problem of fair division. In particular we study ...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
We revisit the classic problem of fair division from a mechanism design perspective, using proportio...
We draw a surprising and direct mathematical equivalence between the class of allocation mechanisms ...
In this paper we study the impact of fairness on the efficiency of allocations. We consider three di...
abstract: the subject of this note is the problem of equitable or fair division. we consider the sim...
Let the unit interval I represent a cake to be divided among n players estimating the measurable sub...
In this article, the fair division problem for two participants in the presence of both divisible an...
We study a fair division problem with indivisible objects like jobs, houses, and one divisible good ...
Fair division with unequal shares is an intensively studied resource allocation problem. For i ∈ [n...
We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanis...
Two or more players rank a set of indivisible items from best to worst. An efficient allocation of i...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, t...
In a recent paper [International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems 8:61...
We revisit the classic problem of fair division from a mechanism design perspective, using Proportio...
International audienceIn this article we study the problem of fair division. In particular we study ...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
We revisit the classic problem of fair division from a mechanism design perspective, using proportio...
We draw a surprising and direct mathematical equivalence between the class of allocation mechanisms ...
In this paper we study the impact of fairness on the efficiency of allocations. We consider three di...
abstract: the subject of this note is the problem of equitable or fair division. we consider the sim...
Let the unit interval I represent a cake to be divided among n players estimating the measurable sub...
In this article, the fair division problem for two participants in the presence of both divisible an...
We study a fair division problem with indivisible objects like jobs, houses, and one divisible good ...
Fair division with unequal shares is an intensively studied resource allocation problem. For i ∈ [n...
We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanis...
Two or more players rank a set of indivisible items from best to worst. An efficient allocation of i...