175 search results - page 7 / 35 » Informed Lifting for Message-Passing |
SIGECOM
2004
ACM
15 years 5 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
100
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
100
click to vote
WOA
2001
15 years 1 months ago
2001
Negotiation is a fundamental mechanism in distributed multi-agent systems. Since negotiation is a time-spending process, in many scenarios agents have to take into account the pas...
ADHOC
2008
14 years 12 months ago
2008
Disruption-tolerant networks (DTNs) differ from other types of networks in that capacity is created by the movements of network participants. This implies that understanding and in...
JCP
2006
14 years 11 months ago
2006
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...