Sciweavers

51 search results - page 7 / 11
» Faster Algorithms for Stable Allocation Problems
Sort
View
CN
2008
140views more  CN 2008»
14 years 9 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
AUSAI
2005
Springer
15 years 3 months ago
Global Versus Local Constructive Function Approximation for On-Line Reinforcement Learning
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
Peter Vamplew, Robert Ollington
PROMAS
2004
Springer
15 years 2 months ago
Coordinating Teams in Uncertain Environments: A Hybrid BDI-POMDP Approach
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
Ranjit Nair, Milind Tambe
AAAI
2000
14 years 11 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
SAC
2004
ACM
15 years 2 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...