Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On conflicts
Pawlak Z. International Journal of Man-Machine Studies21 (2):127-134,1984.Type:Article
Date Reviewed: May 1 1985

In this article a mathematical model of conflict situations, based on three binary relations; alliance, conflict and neutrality, is introduced. Axioms for alliance and conflict relations are given and some properties of these relations are investigated.

Further, the strength of an object is introduced. The set of the three relations mentioned above, together with the strength of all objects, is called the situation. Some rules of transformation of situations are introduced and investigated.

Finally, the notion of a capture is defined and the rules of sharing of the capture among objects in a given situation are formulated. Some theorems concerning capture sharing are given.

The approach presented can be used as a starting point for an easy computer simulation of conflict situations.

--Author’s Abstract

This article is of a mathematical nature. The reader should be familiar with the material in the references included in the paper.

Reviewer:  G. W. Zobrist Review #: CR108968
Bookmark and Share
 
Simulation Theory (I.6.1 )
 
 
Combinatorics (G.2.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Simulation Theory": Date
Efficient distributed event-driven simulations of multiple-loop networks
Lubachevsky B. Communications of the ACM 32(1): 111-123, 1989. Type: Article
Nov 1 1989
Distributed discrete-event simulation
Misra J. ACM Computing Surveys 18(1): 39-65, 1986. Type: Article
Jun 1 1987
An algorithm for parallel discrete event simulation using common memory
Cota B., Sargent R. ACM SIGSIM Simulation Digest 20(1): 23-31, 1989. Type: Article
Aug 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy