Sciweavers

268 search results - page 48 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
CIKM
2009
Springer
15 years 9 months ago
Using domain ontology for semantic web usage mining and next page prediction
This paper proposes the integration of semantic information drawn from a web application’s domain knowledge into all phases of the web usage mining process (preprocessing, patte...
Nizar R. Mabroukeh, Christie I. Ezeife
ATAL
2009
Springer
15 years 9 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
CORR
2012
Springer
193views Education» more  CORR 2012»
13 years 10 months ago
A Unifying Framework for Linearly Solvable Control
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
Krishnamurthy Dvijotham, Emanuel Todorov
ICML
2007
IEEE
16 years 3 months ago
Multi-task reinforcement learning: a hierarchical Bayesian approach
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
Aaron Wilson, Alan Fern, Soumya Ray, Prasad Tadepa...
ICML
2003
IEEE
16 years 3 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum