Optimistic and disjunctive agent design problems

DOI10.1007/3-540-44631-1_1MaRDI QIDQ4473060zbMATH OpenFDO

Authors M. J. Wooldridge, Paul E. Dunne

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1986/19860001.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01)

Recommendations

• The complexity of agent design problems: Determinism and history dependence
• The complexity of achievement and maintenance problems in agent-based systems
• The computational complexity of agent verification
• Improving performance of heterogeneous agents
• Asymptotically optimal agents

Cited in

(4)

• Maintenance goals of agents in a dynamic environment: formulation and policy construction
• The complexity of agent design problems: Determinism and history dependence
• The computational complexity of agent verification
• The complexity of achievement and maintenance problems in agent-based systems

This page was built for publication: Optimistic and disjunctive agent design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473060)