The Computational Complexity of Boolean and Stochastic Agent Design Problems

 
EPrints.org
Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.
Type: Book Section

Dunne, P. E. and Wooldridge, M. (2002) The Computational Complexity of Boolean and Stochastic Agent Design Problems. In: Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-02). , Bologna, Italy.

Full text not available from this archive.

Deposited by AgentLink Archive Administrator on 07 December 2004

Archive Staff Only: edit this record

   

AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact web@agentlink.org.