1636 search results - page 286 / 328 » Using Bayesian Networks to Model Agent Relationships |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
INFOCOM
1995
IEEE
14 years 7 days ago
1995
IEEE
Usage-based pricing of offered traffic to a data network can be an effective technique for congestion control. To gain insight into the benejits usage-based pricing offers, we pro...
TASE
2009
IEEE
14 years 3 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...