Computational complexity of some intelligent computing systems

DOI10.1108/17563781111136676MaRDI QIDQ3100986zbMATH OpenOpenAlexFDO

Authors 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

artificial intelligencegame theoryintelligent agentsknowledge engineeringsystems and control theory

Mathematics Subject Classification ID

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

Recommendations

• Computing equilibria: a computational complexity perspective
• Computation and Complexity in Economic Behavior and Organization
• Complexity of Verifying Game Equilibria
• Computation and Complexity in Economic Behavior and Organization
• Systems of agents controlled by logical programs: complexity of verification

Cites work

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

Cited in

(1)

• On intelligent computers and large computer systems of the new generation

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

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