Sciweavers

894 search results - page 62 / 179
» Game Theory with Costly Computation
Sort
View
MIDDLEWARE
2007
Springer
16 years 8 days ago
Vector-Field Consistency for Ad-Hoc Gaming
Abstract. Developing distributed multiplayer games for ad-hoc networks is challenging. Consistency of the replicated shared state is hard to ensure at a low cost. Current consisten...
Nuno Santos, Luís Veiga, Paulo Ferreira
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
16 years 21 days ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 11 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
PODC
2009
ACM
16 years 6 months ago
On a selfish caching game
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
Pietro Michiardi, Carla-Fabiana Chiasserini, Claud...
CONEXT
2010
ACM
15 years 4 months ago
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
Andrew R. Curtis, S. Keshav, Alejandro Lópe...