• Publications
  • Influence
MASON: A Multiagent Simulation Environment
TLDR
MASON is a fast, easily extensible, discrete-event multi-agent simulation toolkit in Java, designed to serve as the basis for a wide range of multiagent simulation tasks ranging from swarm robotics to machine learning. Expand
  • 858
  • 73
Cooperative Multi-Agent Learning: The State of the Art
TLDR
Cooperative multi-agent systems (MAS) are ones in which several agents attempt, through their interaction, to jointly solve tasks or maximize utility. Expand
  • 1,117
  • 58
  • PDF
MASON: A New Multi-Agent Simulation Toolkit
TLDR
We introduce MASON, a fast, easily extendable, discreteevent multi-agent simulation toolkit in Java, designed to be flexible enough to be used for a wide range of simulations. Expand
  • 340
  • 27
  • PDF
MASON : A Multi-Agent Simulation Environment
TLDR
We introduce MASON, a fast, easily extensible, discrete-event multi-agent simulation toolkit in Java, designed to be flexible enough to be used for a wide range of simple simulations. Expand
  • 196
  • 26
  • PDF
A Comparison of Bloat Control Methods for Genetic Programming
TLDR
We examine several approaches to bloat control and report on their success in managing population size while retaining reasonable best-fitness-of run results. Expand
  • 182
  • 16
  • PDF
A pheromone-based utility model for collaborative foraging
  • Liviu Panait, S. Luke
  • Computer Science
  • Proceedings of the Third International Joint…
  • 19 July 2004
TLDR
We propose two pheromone-based algorithms for artificial agent foraging, trail-creation, and other tasks. Expand
  • 115
  • 13
  • PDF
Lexicographic Parsimony Pressure
TLDR
We introduce a technique called lexicographic parsimony pressure, for controlling the significant growth of genetic programming trees during the course of an evolutionary computation run. Expand
  • 237
  • 11
  • PDF
Tunably decentralized algorithms for cooperative target observation
TLDR
We propose two algorithms, inspired by K-means clustering and hill-climbing respectively, which are scalable in degree of decentralization, and a variant of the cooperative target observation domain which is free of such constraints. Expand
  • 59
  • 10
  • PDF
Fighting Bloat with Nonparametric Parsimony Pressure
TLDR
We introduce two new kinds of nonparametric parsimony pressure, Direct and Proportional Tournament, and show that they are effective in limiting size while still maintaining good best-fitness-of-run results. Expand
  • 96
  • 9
  • PDF