Finding the Pareto optimal equitable allocation of homogeneous divisible goods among three players
Journal Title: Operations Research and Decisions - Year 2017, Vol 27, Issue 3
Abstract
We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS) and the Radon–Nykodim Set (RNS). The algorithm can be considered as an extension of the Adjusted Winner procedure by Brams and Taylor to the three-player case, without the guarantee of envy-freeness.
Authors and Affiliations
Marco DALL’AGLIO, Camilla DI LUCA, Lucia MILONE
Keywords
Related Articles
- EP ID EP323663
- DOI -
- Views 22
- Downloads 0
Verification of a model as a scientific tool of operations research – a methodological approach
The aim of the research presented in this paper was to solve one of the fundamental problems of modelling and simulation, i.e., verification of a model as a scientific tool of operations research. To attack this problem,...
Informatics systems of decision support and analysis of their security
A new approach to security issues associated with the use of teleinformatics systems in the deci-sion-making process has been presented. There is a discussion of the relationship between the security of informatics syste...
Probabilistic models for analyzing the availability and profit of a deteriorating 2-out-of-4 system
This paper deals with modelling and evaluating the availability and profit of a linear consecutive 2-out-of-4 system exposed to three consecutive stages of deterioration before failure. The system will pass through three...
Are we done with preference rankings? If we are, then what?
Intransitive, incomplete and discontinuous preferences are not always irrational but may be based on quite reasonable considerations. Hence, we pursue the possibility of building a theory of social choice on an alternati...
Branch and bound algorithm for discrete multi- level linear fractional programming problem
An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible....