Sciweavers

2678 search results - page 252 / 536
» Voting in social networks
Sort
View
ICDCSW
2006
IEEE
15 years 7 months ago
Interdomain Routing as Social Choice
Interdomain routing is essential to both the stability and efficiency of the global Internet. However, most previous studies focus only on stability, and only on a special class ...
Ronny Ramzi Dakdouk, Semih Salihoglu, Hao Wang, Ha...
INFOCOM
2010
IEEE
14 years 11 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 6 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 10 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...