Sciweavers

1662 search results - page 19 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SAC
2005
ACM
14 years 1 months ago
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process
This paper presents a novel model of reinforcement learning agents. A feature of our learning agent model is to integrate analytic hierarchy process (AHP) into a standard reinforc...
Kengo Katayama, Takahiro Koshiishi, Hiroyuki Narih...
ATAL
2004
Springer
14 years 27 days ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella

Lecture Notes
357views
15 years 6 months ago
Computational Mechanism Design
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001. The focus of this chapter is on the Gen...
David Parkes
ICML
2010
IEEE
13 years 8 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
ATAL
2003
Springer
14 years 22 days ago
Multiagent diffusion and distributed optimization
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Kwok Ching Tsui, Jiming Liu