The kΩ-Optimization Distributed Meta-Level Control for Cooperation and Competition of Bounded Rational Agents Export

@inproceedings{citeulike:6014038, abstract = {The \$-calculus process algebra for problem solving applies the cost performance measures to converge to optimal solutions with minimal problem solving costs. The same meta-level kΩ-optimization control can be used to find the best quality solutions (expressed as optimization problems), the most effective solutions (expressed as search optimization problems), or to find solutions representing the tradeoff between the best quality and least costly solutions (expressed as totally optimization problems). The total optimization is described as an instance of multiobjective optimization. In this paper we demonstrate that cooperation and competition of multiagent systems can be naturally investigated as a multiobjective optimization too. [Resource-based reasoning [10, 12], called also anytime algorithms, trading off the quality of solutions for the amount of resources used, seems to be particularly well suited for the solution of hard computational problems in real time and under uncertainty. On the other hand, process algebras [11] are currently the most mature approach to concurrent and distributed systems, and seem to be the appropriate way to formalize multiagent systems. ]}, author = {Eberbach, Eugene}, booktitle = {Metareasoning in Agent-Based Systems}, citeulike-article-id = {6014038}, citeulike-linkout-0 = {http://www.sis.uncc.edu/~anraja/AAMAS07/CameraReady/eberbach-final.pdf}, keywords = {algebra, compsci, mind}, posted-at = {2009-10-27 03:53:25}, priority = {2}, title = {The kΩ-Optimization Distributed Meta-Level Control for Cooperation and Competition of Bounded Rational Agents}, url = {http://www.sis.uncc.edu/~anraja/AAMAS07/CameraReady/eberbach-final.pdf}, year = {2007} }

TY - CONF ID - citeulike:6014038 L3 - citeulike-article-id:6014038 N2 - The $-calculus process algebra for problem solving applies the cost performance measures to converge to optimal solutions with minimal problem solving costs. The same meta-level kΩ-optimization control can be used to find the best quality solutions (expressed as optimization problems), the most effective solutions (expressed as search optimization problems), or to find solutions representing the tradeoff between the best quality and least costly solutions (expressed as totally optimization problems). The total optimization is described as an instance of multiobjective optimization. In this paper we demonstrate that cooperation and competition of multiagent systems can be naturally investigated as a multiobjective optimization too. [Resource-based reasoning [10, 12], called also anytime algorithms, trading off the quality of solutions for the amount of resources used, seems to be particularly well suited for the solution of hard computational problems in real time and under uncertainty. On the other hand, process algebras [11] are currently the most mature approach to concurrent and distributed systems, and seem to be the appropriate way to formalize multiagent systems. ] TI - The kΩ-Optimization Distributed Meta-Level Control for Cooperation and Competition of Bounded Rational Agents T2 - Metareasoning in Agent-Based Systems KW - algebra KW - compsci KW - mind AU - Eberbach, Eugene PY - 2007/// UR - http://www.sis.uncc.edu/~anraja/AAMAS07/CameraReady/eberbach-final.pdf ER -