Searching for a dining cryptographers problem variant When I frist read about the famous dining cryptographers problem, in a book years ago I remember the author made a twist on it, demonstrating the generalization of the problem.

Basically the dining cryptographers wanted to know who has the best income. But since they all worked for secret agencies, they were not allowed to tell each other. So they had a system where they would write their income down in some order without giving away information to their sitting neighbors on what their income is.
I'm unable to recall the way that system worked and I can't remember what book it was. 

I was hoping somebody recalls this twist on the problem or the book.
I believe I found the reference I was looking for. I believe it's from the book 'Einführung in die Kryptographie' from Albrecht Beutelspacher, Jörg Schwenk and Klaus-Dieter Wolfenstetter, published by Springer. I read it back in college.

In chapter 5.2 on 'Multiparity Computations' they talk about 'Wer verdient mehr' ('who earns most'). The idea is that in a multi-party with >2 participents one of them (Alice) starts by adding their income, i_1, to a random number r, writes it down on a note and passes that note around. Everybody else then adds their income i_n to the number. Once the note arrives back at Alice, Alice then can subtract the random number r and is able to compute the average income of the round, so they can compare if their income is above or below average without exposing any other information. Of course this only works if all participents answers are trustworthy.

A interesting approach. But I was wrong with my assumtion that it had anything to do with the 'dining cryptographers' problem.