In this article, the fair division problem for two participants in the presence of both divisible and indivisible items is considered. Three interrelated modifications of the notion of fair division-profitably, uniformly and equitably fair divisions-were introduced. Computationally efficient algorithm for finding all of them was designed. The algorithm includes repetitive solutions of integer knapsack-type problems as its essential steps. The necessary and sufficient conditions of the existence of proportional and equitable division were found. The statements of the article are illustrated by various examples.Conflict management Negotiation Fairness Knapsack problem
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...
Mathematical procedures that promise an envy-free, equitable, and efficient solution to distribution...
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...
In this paper, a solution method for classical fair division problem utilizing cut-and-choose protoc...
International audienceIn this note we study how to share a good between n players in a simple and eq...
Fair division is a fundamental problem in economic theory and one of the oldest questions faced thro...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
This thesis introduces the fair division problem of Steinhaus. Firstly, necessary definitions and id...
In this paper, we show that the procedure 'Adjusted Winner', introduced by Brams and Taylor (1996), ...
International audienceWe investigate five different fairness criteria in a simple model of fair reso...
We revisit the classic problem of fair division from a mechanism design perspective, using Proportio...
8 pagesInternational audienceWe investigate five different fairness criteria in a simple model of fa...
We initiate the study of control actions in fair division problems where a benevolent or malicious c...
Fair division, a key concern in the design of many social institutions, has for 70 years been the su...
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...
Mathematical procedures that promise an envy-free, equitable, and efficient solution to distribution...
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...
In this paper, a solution method for classical fair division problem utilizing cut-and-choose protoc...
International audienceIn this note we study how to share a good between n players in a simple and eq...
Fair division is a fundamental problem in economic theory and one of the oldest questions faced thro...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
This thesis introduces the fair division problem of Steinhaus. Firstly, necessary definitions and id...
In this paper, we show that the procedure 'Adjusted Winner', introduced by Brams and Taylor (1996), ...
International audienceWe investigate five different fairness criteria in a simple model of fair reso...
We revisit the classic problem of fair division from a mechanism design perspective, using Proportio...
8 pagesInternational audienceWe investigate five different fairness criteria in a simple model of fa...
We initiate the study of control actions in fair division problems where a benevolent or malicious c...
Fair division, a key concern in the design of many social institutions, has for 70 years been the su...
We study fair allocation of indivisible items, where the items are furnished with a set of conflicts...
Mathematical procedures that promise an envy-free, equitable, and efficient solution to distribution...
In this paper we study the impact of fairness on the efficiency of allocations. We consider three di...