An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games

@inproceedings{Faigle1998AnEA,
  title={An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games},
  author={Ulrich Faigle and Walter Kern and Jeroen Kuipers},
  year={1998}
}
We consider classes of TU-games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent result by Kuipers on the computation of the nucleolus for convex games and a classical result by Megiddo on… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…