Sciweavers

894 search results - page 94 / 179
» Game Theory with Costly Computation
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ANCS
2009
ACM
14 years 11 months ago
Design and performance analysis of a DRAM-based statistics counter array architecture
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
Haiquan (Chuck) Zhao, Hao Wang, Bill Lin, Jun (Jim...
WCNC
2010
IEEE
15 years 5 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...
JCM
2008
76views more  JCM 2008»
15 years 1 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
WIOPT
2010
IEEE
14 years 11 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi