Wyniki wyszukiwania - BazTech

1

Fuzzy Alliance and Coalitions that Can Be Formed by Alliance Agents

Mashkov Viktor, Smolarz Andrzej, Lytvynenko Volodymyr

International Journal of Electronics and Telecommunications

|

2023

|

Vol. 69, No. 4

713--718

EN

The paper deals with alliances and coalitions that can be formed by agents or entities. It is assumed that alliance agents cooperate and form coalitions for performing the tasks or missions. It is considered that alliance agents are unselfish. That is, they are more interested in achieving the common goal(s) than in getting personal benefits. In the paper, the concept of fuzzy alliance was introduced. A fuzzy alliance is considered as generalization of traditional alliance allowing agents to decide on the capabilities that their agents can and wanted deliver to coalition. Coalitions that can be formed by fuzzy alliance agents were considered. The definition of the “best” coalition was explained. The method of how to find the “best” coalition among all possible coalitions was suggested and verified by computer simulation.

2

Betweenness, Łukasiewicz Rough Inclusions, Euclidean Representations in Information Systems, Hyper-granules and Conflict Resolution

Polkowski L. T., Nowak B.

Fundamenta Informaticae

|

2016

|

Vol. 147, nr 2/3

337--352

EN

In this work, we approach the problem of data analysis from a new angle: we investigate a relational method of separation of data into disjoint sub–data employing a modified betweenness relation, successfully applied by us in the area of behavioral robotics, and, we set a scheme for applications to be studied. The effect of the action by that relation on data is selection of a sub–data, say, ‘kernel’ with the property that each thing in it is a convex combination, in a sense explained below, of some other things in the kernel. One can say that kernel thus exhibited is ‘self–closed’. Algorithmically, this is achieved by means of a new construct, called by us a ‘dual indiscernibility matrix’. On the other hand, the complement to kernel consists of things in the data, which have some attribute values not met in any other thing. It is proper to call this complement to kernel the residuum. We examine both the kernel and the residuum from the point of view of quality of classification into decision classes for a few standard data sets from the UC Irvine Repository finding the results very satisfactory. Conceptually, our work is set in the framework of rough set theory and rough mereology and the main tool in inducing of the betweenness relation is the Łukasiewicz rough inclusion. Apart from the classification problem, we propose some strategies for conflict resolution based on concepts introduced in this work, and in this way we continue conflict analysis in rough set framework initiated by Zdzisław Pawlak.

3

Wieloagentowy system decyzyjny z dynamicznie generowanymi rozłącznymi klastrami

Przybyła-Kasperek M.

Studia Informatica

|

2013

|

Vol. 34, nr 2A

275--294

PL

Artykuł zawiera zagadnienia związane z procesem podejmowania decyzji globalnych na podstawie wiedzy rozproszonej, przechowywanej w kilku lokalnych bazach wiedzy. W artykule zaproponowano nowe podejście do organizacji struktury systemu umożliwiającego podejmowanie decyzji na podstawie wiedzy rozproszonej. W prezentowanym podejściu rozpatrywany jest system o dynamicznej strukturze. Będziemy dążyć do wyznaczenia grup lokalnych baz wiedzy, na podstawie których wyznaczane są zgodne decyzje dla obiektu testowego. Następnie w utworzonych grupach realizowany będzie proces eliminacji niespójności wiedzy. Decyzje globalne podejmowane są z wykorzystaniem jednej z metod analizy konfliktu. Artykuł zawiera definicję wieloagentowego systemu decyzyjnego o strukturze dynamicznej oraz definicję dynamicznie generowanych klastrów. Przedstawiono opis procesu wyznaczania decyzji globalnych oraz wyniki eksperymentów przeprowadzonych na danych z repozytorium UCI.

EN

The paper includes issues related to process of global decision-making on the basis of knowledge which is stored in several local knowledge bases. The paper proposes a new approach to organization of structure of multi-agent decision- making system, operating on the basis of dispersed knowledge. In the presented system, the local knowledge bases will be combined into groups in a dynamic way. We will seek to designate groups of local bases on which the test object is classified to the decision classes in a similar manner. Then in the created groups a process of elimination inconsistencies in the knowledge will be implemented. Global decisions will be made by using one of the methods of analysis of conflict. The paper includes the definition of multi-agent decision-making system with dynamically generated clusters and a description of global decision-making process. In addition, the paper presents results of experiments carried out on data from the UCI repository.

4

Coalitions of Arguments : An Approach with Constraint Programming

Bistarelli S., Santini F.

Fundamenta Informaticae

|

2013

|

Vol. 124, nr 4

383--401

EN

The aggregation of generic items into coalitions leads to the creation of sets of homogenous entities. In this paper we accomplish this for an input set of arguments, and the result is a partition according to distinct lines of thought, i.e., groups of 'coherent' ideas. We extend Dung's Argumentation Framework (AF) in order to deal with coalitions of arguments. The initial set of arguments is partitioned into not-intersected subsets. All the found coalitions show the same property inherited by Dung, e.g., all the coalitions in the partition are admissible (or conflict-free, complete, stable): they are generated according to Dung's principles. Each of these coalitions can be assigned to a different agent. We use Soft Constraint Programming as a formal approach to model and solve such partitions in weighted AFs: semiring algebraic structures can be used to model different optimization criteria for the obtained coalitions. Moreover, we implement and solve the presented problem with JaCoP, a Java constraint solver, and we test the code over a small-world network.

5

Sojusznicze i koalicyjne uwarunkowania bezpieczeństwa powietrznego

Hać R.

Zeszyty Naukowe / Wyższa Szkoła Oficerska Sił Powietrznych

|

2011

|

Nr 2

37--48

PL

Stabilność środowiska bezpieczeństwa jest wynikiem ponad pięćdziesięcioletniej polityki silnej obrony, euroatlantyckiej integracji i aktywnego partnerstwa realizowanego przez Sojusz Północnoatlantycki. Pomimo tej stabilności koncepcja strategiczna NATO, przyjęta przez sygnatariuszy na szczycie w Lizbonie 19-20 listopada 2010 roku, wskazuje na szereg zagrożeń w obszarze zagrożeń konwencjonalnych, które nie mogą być zignorowane. Większość z tych zagrożeń ma znaczący wpływ na kształtowanie się bezpieczeństwa powietrznego, rozpatrywanego w skali państwa, jak i całego regionu euroatlantyckiego.

EN

The stability of the environment of security result from more than fifty-year-long strong defence policy combined with the European-Atlantic integration and active partnership implemented by NATO. Despite the aforementioned stability the Strategic Concept for the Defence and Security of the Members of the North Atlantic Treaty, adopted by the document signatories during the Lisbon summit held from the 19 till 20 November 2010, point out a number of hazard within the area of conventional threats, which must not be ignored. The majority of such threats exert a significant impact on shaping air security as analysed both on the scale of the national and the Euro-Atlantic area level.

6

Alliance and Coalition Formation

Fišer J., Mashkov V.

Journal of Applied Computer Science

|

2010

|

Vol. 18, nr 1

19-38

EN

Rapid development of agent technologies has evoked new research problems, among them formation of the groups of agents, such as alliances and coalitions. In the paper we differentiate between alliances and coalitions and suggest approaches to their formation. Agents of the highlighted alliances and coalitions are considered as group-rational, i.e., more interested in achieving the common goal than in their own benefits. The paper deals with specific alliances in which an agent accepts the offer to join the alliance despite the fact that one or more clauses of the planned alliance are not acceptable for him. This way, the agent may participate in the alliance on restricted conditions. The paper focuses on the problems of alliance and coalition formation, specifically, on the issues of agents’ activities at the stage of alliance and coalition structuring. For different cases when an agent is either informed about other agents’ capabilities or not, different agent’s activities are considered. For the purposes of modeling and verification of the proposed algorithms and approaches to alliance and coalition formation the Erlang/OTP platform is used. The paper specifies how the Erlang/OTP platform can be used for modeling agents’ intercommunication during formation of coalitions.

7

Technology solutions for coalition operations

Wiemer D.

Journal of Telecommunications and Information Technology

|

2004

|

nr 4

31-38

EN

As computer technology has advanced, information processing in command, control, communications, computers, intelligence, surveillance and reconnaissance (C4ISR) systems has become highly complex. The information processed by these systems is usually of a very highly sensitive nature and is entered into specific systems that are physically isolated from each other. The physical isolation of these systems makes it cumbersome to exchange information between systems. The result is inefficient sharing of sensitive information in situations where timeliness of exchange could be a life or death reality. Since the mid 1990's, increasing efforts have been placed on improving coalition operations. Many systems have been created with the goal to improve the sharing of information and collaborative planning across coalition boundaries. The usability of these systems have had mixed levels of success and improvements will always be necessary. This paper will briefly describe three advances in telecommunications technology that could be leveraged to significantly improve coalition operations. These technologies are; the session border controller (SBC), advances in pattern matching technology, and multi-protocol label switching (MPLS).

8

Sharing tactical data in a network-enabled coalition

Busch J., Russo R.

Journal of Telecommunications and Information Technology

|

2004

|

nr 4

45-52

EN

The NATO Command, Control and Consultation Agency (NC3A) is a participant in a coalition project called the Shared Tactical Pictures (STP). The aim of STP is to develop methods and techniques to enable the sharing of a wide variety of information -e.g., ground surveillance sensors, airborne sensor platforms, recognized pictures, and much more - across a widely distributed network. As NATO changes its war-fighting paradigm from a well-known and stable alliance configuration to more flexible, coalition-based operations, solving the problem of information-sharing has never been more important. This paper discusses the technical and operational developments being explored in STP.

9

A Rough Set Approach to Estimating the Game Value and the Shapley Value from Data

Polkowski L., Araszkiewicz B.

Fundamenta Informaticae

|

2002

|

Vol. 53, nr 3,4

335-343

EN

A value of a game v is a function which to each coalition S assigns the value v(S) of this coalition, meaning the expected pay-off for players in that coalition. A classical approach of von Neumann and Morgenstern [6] had set some formal requirements on v which contemporary theories of value adhere to. A Shapley value of the game with a value v [14] is a functional F giving for each player p the value Fp(v) estimating the expected pay-off of the player p in the game. Game as well as conflict theory have been given recently much attention on the part of rough and fuzzy set communities [11, 8,1,4,7,2]. In particular, problems of plausible strategies in conflicts as well as problems related to Shapley's value [3,2] have been addressed. We confront here the problem of estimating a value as well as Shapley's value of a game from a partial data about the game. We apply to this end the rough set ideas of approximations, defining the lower and the upper value of the game and, respectively, the lower and the upper Shapley value. We also define a notion of an exact coalition, on which both values coincide giving the true value of the game; we investigate the structure of the family of exact sets showing its closeness on complements, disjoint sums, and intersections of coalitions covering the set of players. This work sets open a new area of rough set applications in mining constructs from data. The constructs mined in this case are values as well as Shapley values of games.