Sciweavers

533 search results - page 34 / 107
» Playing games with approximation algorithms
Sort
View
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
14 years 2 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu
ATAL
2004
Springer
14 years 1 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
HT
2003
ACM
14 years 29 days ago
Paper chase revisited: a real world game meets hypermedia
In this short paper, we present a location aware mobile game which lets users play a paper chase game on a mobile device. By using their physical movement and location in the real...
Susanne Boll, Jens Krösche, Christian Wegener
ATAL
2007
Springer
14 years 1 months ago
Policy recognition for multi-player tactical scenarios
This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observat...
Gita Sukthankar, Katia P. Sycara
AIIDE
2009
13 years 8 months ago
Demonstrating Automatic Content Generation in the Galactic Arms Race Video Game
In most modern video games, content (e.g. models, levels, weapons, etc.) shipped with the game is static and unchanging, or at best, randomized within a narrow set of parameters. ...
Erin J. Hastings, Ratan K. Guha, Kenneth O. Stanle...