Sciweavers

3780 search results - page 70 / 756
» Algorithms for Game Metrics
Sort
View
AAAI
2007
14 years 8 days ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
DIGRA
2005
Springer
14 years 3 months ago
Realistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...
Ross Graham, Hugh McCabe, Stephen Sheridan
COLT
1997
Springer
14 years 2 months ago
On-line Learning and the Metrical Task System Problem
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
Avrim Blum, Carl Burch
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 10 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...