We discuss the theoretical design of algorithms for solving distributional conﬂicts within groups. We consider an algorithm to be procedural if the implementation of the outcome requires the participation of the players, or if it can even be conducted by the players themselves without computational assistance. We compare two procedures for multilateral problems of fair division; both establish envy-freeness, given the possibility of monetary compensations between players.
© 2000 The International Institute for Advanced Studies
M. G. Raith, F. E. Su, Procedural support for cooperative negotiations, Advances in Decision Technology and Intelligent Information Systems, Vol. I, 31–36 (2000).