Sciweavers

4435 search results - page 34 / 887
» Algorithms, games, and the internet
Sort
View
WINE
2007
Springer
166views Economy» more  WINE 2007»
14 years 4 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ļ¬...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
LICS
2009
IEEE
14 years 4 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
AAAI
2010
13 years 10 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
ATAL
2004
Springer
14 years 3 months 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»
14 years 2 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