Sciweavers

856 search results - page 93 / 172
» On Randomness Measures for Social Networks.
Sort
View
AAMAS
2007
Springer
15 years 6 months ago
Local strategy learning in networked multi-agent team formation
Abstract. Networked multi-agent systems are comprised of many autonomous yet interdependent agents situated in a virtual social network. Two examples of such systems are supply cha...
Blazej Bulka, Matthew E. Gaston, Marie desJardins
WINE
2010
Springer
201views Economy» more  WINE 2010»
15 years 4 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
ICCTA
2007
IEEE
15 years 10 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
JSAC
2008
139views more  JSAC 2008»
15 years 6 months ago
A Game-Theoretic Framework for Medium Access Control
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
Tao Cui, Lijun Chen, Steven H. Low
IPTPS
2004
Springer
15 years 11 months ago
On the Cost of Participating in a Peer-to-Peer Network
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate,...
Nicolas Christin, John Chuang