In this paper we reformulate three fair-division algorithms as practical, c
ooperative negotiation procedures that can be applied to a more general cla
ss of multiple-issue negotiations. The procedures consist of two simple and
intuitive steps: the first step ensures an efficient outcome, and the seco
nd step establishes 'fairness' through a redistribution of gains. For all p
rocedures we also compare the outcomes of 'issue-by-issue' negotiations and
'package deals.' (C) 2000 Elsevier Science B.V. All rights reserved.