We first advocate that the AUML (Agent Unified Modeling Language) notation, even in its new version, is not precise enough to adequately describe protocols. This problem was long identified by Harel and we propose to follow his solution: extend sequence diagrams with a "prechart", i.e. single out th
The complexity of cooperation: Agent-based models of competition and collaboration
β Scribed by Andrew M. Colman
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 56 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We completely classify the computational complexity of the basic achievement and maintenance agent design problems in bounded environments when these problems are parameterized by the number of environment states and the number of agent actions. The different problems are P-complete, NP-complete, co
We show how the tension between cooperation and competition affects the dynamics of learning alliances. 'Private benefits' and 'common benefits' differ in the incentives that they create for investment in learning. The competitive aspects of alliances are most severe when a firm's ratio of private t