Add to ORKGIn this paper, a solution method for classical fair division problem utilizing cut-and-choose protocol has been examined and a new method has been suggested in order to eliminate the deficiencies of that method. Furthermore, the problem has been generalized and mathematical models have been written according to oddness or evenness of the number of persons and solution techniques have been given. © IDOSI Publications, 2011
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, t...
Single-peaked preferences, Uniform rule, Nash implementability, Maskin monotonicity, No veto power, ...
AbstractWe show the existence of a fair division for countably many participants and that the relate...
In this article, the fair division problem for two participants in the presence of both divisible an...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
We initiate the study of control actions in fair division problems where a benevolent or malicious c...
Fair division is a fundamental problem in economic theory and one of the oldest questions faced thro...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityThis dissertation develops pro...
Fair division, a key concern in the design of many social institutions, has for 70 years been the su...
This thesis introduces the fair division problem of Steinhaus. Firstly, necessary definitions and id...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, ...
In this paper, we show that the procedure 'Adjusted Winner', introduced by Brams and Taylor (1996), ...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
abstract: the subject of this note is the problem of equitable or fair division. we consider the sim...
International audienceIn this article we study the problem of fair division. In particular we study ...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, t...
Single-peaked preferences, Uniform rule, Nash implementability, Maskin monotonicity, No veto power, ...
AbstractWe show the existence of a fair division for countably many participants and that the relate...
In this article, the fair division problem for two participants in the presence of both divisible an...
In this article we study a cake cutting problem. More precisely, we study symmetric fair division al...
We initiate the study of control actions in fair division problems where a benevolent or malicious c...
Fair division is a fundamental problem in economic theory and one of the oldest questions faced thro...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityThis dissertation develops pro...
Fair division, a key concern in the design of many social institutions, has for 70 years been the su...
This thesis introduces the fair division problem of Steinhaus. Firstly, necessary definitions and id...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, ...
In this paper, we show that the procedure 'Adjusted Winner', introduced by Brams and Taylor (1996), ...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
abstract: the subject of this note is the problem of equitable or fair division. we consider the sim...
International audienceIn this article we study the problem of fair division. In particular we study ...
It is often necessary to divide a certain amount of money between n participants, i.e., to assign, t...
Single-peaked preferences, Uniform rule, Nash implementability, Maskin monotonicity, No veto power, ...
AbstractWe show the existence of a fair division for countably many participants and that the relate...