Sciweavers

1568 search results - page 37 / 314
» On a network creation game
Sort
View
GLOBECOM
2007
IEEE
15 years 8 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
KIVS
2009
Springer
15 years 8 months ago
A Middleware for the Controlled Information Exchange Between Online Games and Internet Applications
Multiplayer Online Games (MOGs) are a thriving market leading to a multiplicity of game related internet applications. Enabling information exchange between games and these applica...
Sonja Bergsträsser, Tomas Hildebrandt, Christ...
INFOCOM
2006
IEEE
15 years 8 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
IADIS
2004
15 years 3 months ago
Challenges for Network Computer Games
Interactive entertainment and specifically computer games has grown into a multi-billion industry in the last few years and continues to grow. This expansion has fueled a number o...
Yusuf Pisan
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
15 years 9 days ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...