Sciweavers

5995 search results - page 95 / 1199
» Algorithmic Game Theory
Sort
View
LICS
2009
IEEE
16 years 1 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
ATAL
2004
Springer
16 years 2 days ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
15 years 11 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
ECAI
2008
Springer
15 years 8 months ago
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form
Abstract. In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strateg...
Nicola Gatti
ESA
2010
Springer
236views Algorithms» more  ESA 2010»
15 years 7 months 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 ...