Be the first to like this
Talk given at COMSOC 2011.
Fair Participation, a special case of Fair Division or something else?
From Pietro Speroni and Cyril Velikanov
It is common in collaborative systems to allow users to submit their contributions (proposals and/or comments) and then evaluate each other's contributions. Most of such systems also exhibit a list of the highest rated contributions, with an implicit assumption that those are the best, the most relevant, the most interesting ones. Indeed, the highest rated ones are often interesting enough, but the opposite is not necessarily true. With a system as described above (of a kind that is nearly ubiquitous on the Internet), a really good contribution may easily pass unnoticed, without ever being evaluated at its real importance and real interest it presents. In a sense, this issue, which we call "fair collaboration" or "fair participation", is related to a well-known research topic, "fair division". We will analyze how the two topics are relating to each other, and under what assumption can "fair collaboration" be seen as a case of "fair division". We will also suggest some possible solutions, and draft directions of further study.
Page in my home page:
This talk was given to a rather technical audience, so everybody knew what the mathematical field of "fair division" was. Also known as the cake cutting problem. Here is a Wikipedia page, some notes and a presentation. The notes and the presentation are from Ulle Endriss. The same guy that I refer in the beginning of the talk.
Clipping is a handy way to collect important slides you want to go back to later.