Principles of data mining
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Intentional learning agent architecture
Autonomous Agents and Multi-Agent Systems
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Learning classifier systems: a complete introduction, review, and roadmap
Journal of Artificial Evolution and Applications
Empirical hardness for mixed auctions
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
A hybrid agent architecture integrating desire, intention and reinforcement learning
Expert Systems with Applications: An International Journal
Learning within the BDI framework: an empirical analysis
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
| Hi-index | 0.00 |
This paper considers planning algorithms of adaptive bounded rational goal-driven agents. Plans are assumed to be correlated. Parallels to mixed multi-unit combinatorial auctions are highlighted. Possibilities of using available solutions for the winner determination problem of these auctions in the planning context are discussed. A novel algorithm is presented, where plan combinations are a heuristic that reduces the search space but keeps agents adaptive.