8468 search results - page 1521 / 1694 » Intelligent agents in e-services |
189
click to vote
TASE
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
153
click to vote
ATAL
2009
Springer
16 years 14 days ago
2009
Springer
The most important and interesting of the computing challenges we are facing are those that involve the problems and opportunities afforded by massive decentralization and disinte...
166
click to vote
ATAL
2009
Springer
16 years 14 days ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
158
click to vote
ATAL
2009
Springer
16 years 14 days ago
2009
Springer
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
150
click to vote
ATAL
2009
Springer
16 years 14 days ago
2009
Springer
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...