Computational complexity of some intelligent computing systems

DOI10.1108/17563781111136676zbMath1233.91030OpenAlexW2009630174MaRDI QIDQ3100986

Emmanuel Tadjouddine

Publication date: 22 November 2011

Published in: International Journal of Intelligent Computing and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/17563781111136676

zbMATH Keywords

game theoryartificial intelligenceknowledge engineeringintelligent agentssystems and control theory

Mathematics Subject Classification ID

Games in extensive form (91A18) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)

Cites Work

• Auction design with costly preference elicitation
• On the complexity of the parity argument and other inefficient proofs of existence
• On the computational complexity of coalitional resource games
• The Elimination form of the Inverse and its Application to Linear Programming
• Programming and Verifying Subgame-Perfect Mechanisms
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding

This page was built for publication: Computational complexity of some intelligent computing systems