Sciweavers

89 search results - page 2 / 18
» A New Logarithmic Normalization Method in Games Theory
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SAGA
2007
Springer
14 years 12 days ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
ATAL
2010
Springer
13 years 7 months ago
On the logic of argumentation theory
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
Davide Grossi
AI
2002
Springer
13 years 6 months ago
Multiagent learning using a variable learning rate
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on ...
Michael H. Bowling, Manuela M. Veloso
ICSE
2010
IEEE-ACM
13 years 4 months ago
Synthesized essence: what game jams teach about prototyping of new software products
The development of video games comprises engineering teams within various disciplines, e.g., software engineering, game production, and creative arts. Game jams are a promising ap...
Juergen Musil, Angelika Schweda, Dietmar Winkler, ...