Sciweavers

42 search results - page 8 / 9
» New Maximal Numbers of Equilibria in Bimatrix Games
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 8 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 9 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
WCNC
2010
IEEE
13 years 11 months ago
Hedonic Coalition Formation Games for Secondary Base Station Cooperation in Cognitive Radio Networks
— In order to maintain a conflict-free environment among licensed primary users (PUs) and unlicensed secondary users (SUs) in cognitive radio networks, providing frequency and g...
Walid Saad, Zhu Han, Tamer Basar, Are Hjøru...
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