106 search results - page 10 / 22 » Connectivity and Equilibrium in Random Games |
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
CG
2010
Springer
13 years 5 months ago
2010
Springer
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...