Sciweavers

1599 search results - page 244 / 320
» Algorithms for Parity Games
Sort
View
QUESTA
2010
89views more  QUESTA 2010»
14 years 8 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
Ali Devin Sezer
PIMRC
2010
IEEE
14 years 7 months ago
Self-optimizing routing in MANETs with multi-class flows
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Pierre Coucheney, Bruno Gaujal, Corinne Touati
ATAL
2007
Springer
15 years 4 months ago
Advice taking in multiagent reinforcement learning
This paper proposes the β-WoLF algorithm for multiagent reinforcement learning (MARL) in the stochastic games framework that uses an additional “advice” signal to inform agen...
Michael Rovatsos, Alexandros Belesiotis
ML
2006
ACM
113views Machine Learning» more  ML 2006»
14 years 9 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
ATAL
2009
Springer
15 years 4 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski