We discuss how the notion of gradual information disclosure can be incorporated into basic social computing protocols, such as reputation-based service selection. Our technique links the decrease in anonymity a subject is ready to endure (e.g., by disclosing the values of some of her attributes) to the weight her views will carry in the final outcome of the protocol. © 2009 IEEE.
Damiani, E., Viviani, M. (2009). Trading anonymity for influence in open communities voting schemata. In Proceedings - 2009 International Workshop on Social Informatics, SOCINFO 2009 (pp.63-67) [10.1109/SocInfo.2009.10].
Trading anonymity for influence in open communities voting schemata
Damiani, E;Viviani, M.
2009
Abstract
We discuss how the notion of gradual information disclosure can be incorporated into basic social computing protocols, such as reputation-based service selection. Our technique links the decrease in anonymity a subject is ready to endure (e.g., by disclosing the values of some of her attributes) to the weight her views will carry in the final outcome of the protocol. © 2009 IEEE.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
