Abstract

In this paper we reformulate three fair-division algorithms as practical, cooperative negotiation procedures that can be applied to a more general class of multiple-issue negotiations. The procedures consist of two simple and intuitive steps: the first step ensures an efficient outcome, and the second step establishes ‘fairness’ through a redistribution of gains. For all procedures we also compare the outcomes of ‘issue-by-issue’ negotiations and ‘package deals.’

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call