A search based approach to fairness analysis in requirement assignments to aid negotiation, mediation and decision making

Authors:
Anthony Finkelstein;Mark Harman;S. Afshin Mansouri;Jian Ren;Yuanyuan Zhang
Affiliations:
University College London, Malet Place, WC1E 6BT, London, UK;King’s College London, Strand, WC2R 2LS, London, UK;Brunel University, UB8 3PH, Uxbridge, Middlesex, UK;King’s College London, Strand, WC2R 2LS, London, UK;King’s College London, Strand, WC2R 2LS, London, UK
Venue:
Requirements Engineering - Special Issue on RE'08: Requirements Engineering for a Sustainable World; Guest Editor: T. Tamai
Year:
2009

Citing 0
Cited 7

Reasoning with optional and preferred requirements

ER'10 Proceedings of the 29th international conference on Conceptual modeling
A study of the bi-objective next release problem

Empirical Software Engineering
Comparing the performance of metaheuristics for the analysis of multi-stakeholder tradeoffs in requirements optimisation

Information and Software Technology
A framework for validating task assignment in multiagent systems using requirements importance

PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (keynote paper)

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Interactive requirements prioritization using a genetic algorithm

Information and Software Technology
A systematic literature review of software requirements prioritization research

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper uses a multi-objective optimisation approach to support investigation of the trade-offs in various notions of fairness between multiple customers. Results are presented to validate the approach using two real-world data sets and also using data sets created specifically to stress test the approach. Simple graphical techniques are used to visualize the solution space. The paper also reports on experiments to determine the most suitable algorithm for this problem, comparing the results of the NSGA-II algorithms, a widely used multi objective evolutionary algorithm, and the Two-Archive evolutionary algorithm, a recently proposed alternative.