856 search results - page 99 / 172 » On Randomness Measures for Social Networks. |
162
click to vote
SAGT
2009
Springer
16 years 21 days ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
193
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
143
click to vote
JTAER
2008
15 years 6 months ago
2008
There is considerable excitement about the notion of 'Web 2.0', particularly among Internet businesspeople. In contrast, there is an almost complete lack of formal liter...
199
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
212
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...