Sciweavers

1599 search results - page 43 / 320
» Algorithms for Parity Games
Sort
View
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
15 years 13 days ago
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
Tobias Harks, Martin Hoefer, Max Klimm, Alexander ...
STOC
2004
ACM
104views Algorithms» more  STOC 2004»
15 years 11 months ago
Network games
The growth in computer games and wireless networks has catalyzed the production of a new generation of hand-held game consoles that support multi-player gaming over IEEE 802.11 ne...
Éva Tardos
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
15 years 13 days 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
SODA
2010
ACM
145views Algorithms» more  SODA 2010»
14 years 9 months ago
On the Equilibria of Alternating Move Games
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
CORR
2004
Springer
144views Education» more  CORR 2004»
14 years 11 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia