Sciweavers

1277 search results - page 250 / 256
» Terminating Decision Algorithms Optimally
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
GLOBECOM
2009
IEEE
15 years 23 days ago
Conjectural Equilibrium in Water-Filling Games
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
Yi Su, Mihaela van der Schaar
ATAL
2010
Springer
14 years 9 months ago
A probabilistic model for trust and reputation
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
George Vogiatzis, Ian MacGillivray, Maria Chli
ADHOC
2007
122views more  ADHOC 2007»
14 years 9 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
PODC
2011
ACM
14 years 10 days ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses