PP201307: Endriss, Ulle (2013) Reduction of Economic Inequality in Combinatorial Domains. [Report]

Text (Full Text)
PP201307.text.pdf Download (322kB)  Preview 

Text (Abstract)
PP201307.abstract.txt Download (1kB) 
Abstract
Criteria for measuring economic inequality, such as the Lorenz curve and the Gini index, are widely used in the social sciences but have hardly been explored in Multiagent Systems, even though the significance of other concepts from fair division is widely accepted in the field. In a departure from the standard model used in Economics, we apply inequality criteria to allocation problems with indivisible goods, i.e., to the kind of problem typically analysed in Multiagent Systems. This gives rise to the combinatorial optimisation problem of computing an allocation that reduces inequality with respect to an initial allocation (and the closely related problem of minimising inequality), for a chosen inequality measure. We define this problem, we discuss the computational complexity of various aspects of it, and we formulate a generic approach to designing modular algorithms for solving it using integer programming.
Item Type:  Report 

Report Nr:  PP201307 
Series Name:  Prepublication (PP) Series 
Year:  2013 
Uncontrolled Keywords:  fair division; computational complexity 
Subjects:  Computation 
Depositing User:  Ulle Endriss 
Date Deposited:  12 Oct 2016 14:37 
Last Modified:  12 Oct 2016 14:37 
URI:  https://eprints.illc.uva.nl/id/eprint/479 
Actions (login required)
View Item 