Sciweavers

11 search results - page 2 / 3
» Payoff-Monotonic Game Dynamics and the Maximum Clique Proble...
Sort
View
NIPS
2001
13 years 9 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
SIAMDM
2010
131views more  SIAMDM 2010»
13 years 2 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
14 years 17 days ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
INFOCOM
2009
IEEE
14 years 2 months ago
Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
PODC
2005
ACM
14 years 1 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking