Sciweavers

466 search results - page 40 / 94
» A Parallel General Game Player
Sort
View
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
13 years 11 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
FDG
2009
ACM
14 years 4 months ago
Exertion in networked games
Physical play familiar from sports activities is a favorite pastime across all cultures and has been attributed with many social, mental and physical health benefits. However, the...
Florian Mueller
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
AAAI
2010
13 years 11 months ago
Fixing a Tournament
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
Virginia Vassilevska Williams