Sciweavers

344 search results - page 35 / 69
» Banach-Mazur Games on Graphs
Sort
View
RSA
2011
92views more  RSA 2011»
13 years 3 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
ASUNAM
2009
IEEE
14 years 3 months ago
An Analytical Way to Find Influencers on Social Networks and Validate their Effects in Disseminating Social Games
As the weight of online social networks (OSNs) which provide powerful means of sharing common interests and communicating has gradually grown up, influencers are also given the gr...
Erica Suyeon Kim, Steve SangKi Han
GLOBECOM
2008
IEEE
14 years 3 months ago
Network Formation Games for Distributed Uplink Tree Construction in IEEE 802.16J Networks
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
MFCS
2010
Springer
13 years 7 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
14 years 17 days ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla