Made available in DSpace on 2016-04-27T17:27:11Z (GMT). No. of bitstreams: 1 Cassia Sampaio Sanctos.pdf: 875084 bytes, checksum: 3baa23ce43e41c748fa70bf983f30e20 (MD5) Previous issue date: 2015-05-11 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The thesis constitutes a critical review of Gödel´s doctoral dissertation which presents a proof for the completeness of first order logic. The introduction addresses the concepts of formalism, axiomatic method and completeness, thus the proof can be contextualized. The language for the restricted functional calculus is defined, with the corresponding syntax and semantics, and the original Gödel´s demonstration is updated. The appendix contains a translation of the referred dissertation, which is unprecedented in Portuguese / O trabalho constitui um comentário crítico da dissertação de doutorado de Gödel que apresenta uma prova de completude da lógica de primeira ordem. A introdução trata dos conceitos de formalismo, método axiomático e completude, para que seja possível contextualizar a prova. A linguagem para o cálculo funcional restrito é definida, com sua sintaxe e semântica, e a demonstração original de Gödel é atualizada. O apêndice contém a tradução da referida dissertação, que é inédita em língua portuguesa

Submitted by ROSEMEIRE DE FATIMA BATISTELA null (rosebatistela@hotmail.com) on 2017-02-11T02:22:43Z No. of bitstreams: 1 tese finalizada 10 fevereiro 2017 com a capa.pdf: 2263896 bytes, checksum: 413948c6a47fb47a21e1587275d29c03 (MD5) / Approved for entry into archive by Juliano Benedito Ferreira (julianoferreira@reitoria.unesp.br) on 2017-02-15T16:56:58Z (GMT) No. of bitstreams: 1 batistela_rf_dr_rcla.pdf: 2263896 bytes, checksum: 413948c6a47fb47a21e1587275d29c03 (MD5) / Made available in DSpace on 2017-02-15T16:56:58Z (GMT). No. of bitstreams: 1 batistela_rf_dr_rcla.pdf: 2263896 bytes, checksum: 413948c6a47fb47a21e1587275d29c03 (MD5) Previous issue date: 2017-02-02 / Apresentamos nesta tese uma proposta de inserção do tema teorema da incompletude de Gödel em cursos de Licenciatura em Matemática. A interrogação norteadora foi: como sentidos e significados do teorema da incompletude de Gödel podem ser atualizados em cursos de Licenciatura em Matemática? Na busca de elaborarmos uma resposta para essa questão, apresentamos o cenário matemático presente à época do surgimento deste teorema, expondo-o como a resposta negativa para o projeto do Formalismo que objetivava formalizar toda a Matemática a partir da aritmética de Peano. Além disso, trazemos no contexto, as outras duas correntes filosóficas, Logicismo e Intuicionismo, e os motivos que impossibilitaram o completamento de seus projetos, que semelhantemente ao Formalismo buscaram fundamentar a Matemática sob outras bases, a saber, a Lógica e os constructos finitistas, respectivamente. Assim, explicitamos que teorema da incompletude de Gödel aparece oferecendo resposta negativa à questão da consistência da aritmética, que era um problema para a Matemática na época, estabelecendo uma barreira intransponível para a demonstração dessa consistência, da qual dependia o sucesso do Formalismo e, consequentemente, a fundamentação completa da Matemática no ideal dos formalistas. Num segundo momento, focamos na demonstração deste teorema expondo-a em duas versões distintas, que para nós se nos mostraram apropriadas para serem trabalhadas em cursos de Licenciatura em Matemática. Uma, como possibilidade de conduzir o leitor pelos meandros da prova desenvolvida por Gödel em 1931, ilustrando-a, bem como, as ideias utilizadas nela, aclarando a sua compreensão. Outra, como opção que valida o teorema da incompletude apresentando-o de maneira formal, portanto, com endereçamentos e objetivos distintos, por um lado, a experiência com a numeração de Gödel e a construção da sentença indecidível, por outro, com a construção formal do conceito de método de decisão de uma teoria. Na sequência, apresentamos uma discussão focada na proposta de Bourbaki para a Matemática, por compreendermos que a atitude desse grupo revela a forma como o teorema da incompletude de Gödel foi acolhido nessa ciência e como ela continuou após este resultado. Nessa exposição aparece que o grupo Bourbaki assume que o teorema da incompletude não impossibilita que a Matemática prossiga em sua atividade, ele apenas sinaliza que o aparecimento de proposições indecidíveis, até mesmo na teoria dos números naturais, é inevitável. Finalmente, trazemos a proposta de como atualizar sentidos e significados do teorema da incompletude de Gödel em cursos de Licenciatura em Matemática, aproximando o tema de conteúdos agendados nas ementas, propondo discussão de aspectos desse teorema em diversos momentos, em disciplinas que julgamos apropriadas, culminando no trabalho com as duas demonstrações em disciplinas do último semestre do curso. A apresentação é feita tomando como exemplar um curso de Licenciatura em Matemática. Consideramos por fim, a importância do trabalho com um resultado tão significativo da Lógica Matemática que requer atenção da comunidade da Educação Matemática, dado que as consequências deste teorema se relacionam com a concepção de Matemática ensinada em todos os níveis escolares, que, muito embora não tenham relação com conteúdos específicos, expõem o alcance do método de produção da Matemática. / In this thesis we present a proposal to insert Gödel's incompleteness theorem in Mathematics Education undergraduate courses. The main research question guiding this investigation is: How can the senses and meanings of Gödel's incompleteness theorem be updated in Mathematics Education undergraduate courses? In answering the research question, we start by presenting the mathematical scenario from the time when the theorem emerged; this scenario proposed a negative response to the project of Formalism, which aimed to formalize all Mathematics based upon Peano’s arithmetic. We also describe Logicism and Intuitionism, focusing on reasons that prevented the completion of these two projects which, in similarly to Formalism, were sought to support mathematics under other bases of Logic and finitists constructs. Gödel's incompleteness theorem, which offers a negative answer to the issue of arithmetic consistency, was a problem for Mathematics at that time, as the Mathematical field was passing though the challenge of demonstrating its consistency by depending upon the success of Formalism and upon the Mathematics’ rationale grounded in formalists’ ideal. We present the proof of Gödel's theorem by focusing on its two different versions, both being accessible and appropriate to be explored in Mathematics Education undergraduate courses. In the first one, the reader will have a chance to follow the details of the proof as developed by Gödel in 1931. The intention here is to expose Gödel’ ideas used at the time, as well as to clarify understanding of the proof. In the second one, the reader will be familiarized with another proof that validates the incompleteness theorem, presenting it in its formal version. The intention here is to highlight Gödel’s numbering experience and the construction of undecidable sentence, and to present the formal construction of the decision method concept from a theory. We also present a brief discussion of Bourbaki’s proposal for Mathematics, highlighting Bourbaki’s group perspective which reveals how Gödel’s incompleteness theorem was important and welcome in science, and how the field has developed since its result. It seems to us that Bourbaki’s group assumes that the incompleteness theorem does not preclude Mathematics from continuing its activity. Thus, from Bourbaki’s perspective, Gödel’s incompleteness theorem only indicates the arising of undecidable propositions, which are inevitable, occurring even in the theory of natural numbers. We suggest updating the senses and the meanings of Gödel's incompleteness theorem in Mathematics Education undergraduate courses by aligning Gödel's theorem with secondary mathematics school curriculum. We also suggest including discussion of this theorem in different moments of the secondary mathematics school curriculum, in which students will have elements to build understanding of the two proofs as a final comprehensive project. This study contributes to the literature by setting light on the importance of working with results of Mathematical Logic such as Gödel's incompleteness theorem in secondary mathematics courses and teaching preparation. It calls the attention of the Mathematical Education community, since its consequences are directly related to the design of mathematics and how it is being taught at all grade levels. Although some of these mathematics contents may not be related specifically to the theorem, the understanding of the theorem shows the broad relevance of the method in making sense of Mathematics.

<p>The agent technology represents one of the most consistent approaches to distributed artificial intelligence. Agents are characterized by autonomous, reactive, proactive, and social behavior.&nbsp;In addition, more complex, intelligent agents are often defined&nbsp;in terms of human-like mental attitudes, such as beliefs, desires,&nbsp;and intentions.</p><p>This thesis deals with software agents and multiagent systems&nbsp;in several ways. First, it defines a new reasoning architecture&nbsp;for intelligent agents called<em> Distributed Non-Axiomatic Reasoning System </em>(DNARS). Instead of the popular Belief-Intention-Desire model, it uses Non-Axiomatic Logic, a formalism developed for the domain of articial general intelligence. DNARS&nbsp;is highly-scalable, capable of answering questions and deriving&nbsp;new knowledge over large knowledge bases, while, at the same&nbsp;time, concurrently serving large numbers of external clients.&nbsp;</p><p>Secondly, the thesis proposes a novel agent runtime environment&nbsp;named<em> Siebog.</em> Based on the modern web and enterprise stan-dards, Siebog tries to reduce the gap between the agent technology and industrial applications. Like DNARS, Siebog is a&nbsp;distributed system. Its server side runs on computer clusters&nbsp;and provides advanced functionalities, such as automatic agent&nbsp;load-balancing and fault-tolerance. The client side, on the other<br />hand, runs inside web browsers, and supports a wide variety of&nbsp;hardware and software platforms.</p><p>Finally, Siebog depends on DNARS for deploying agents with&nbsp;unique reasoning capabilities.</p> / null / <p>Agentska tehnologija predstavlja dosledan pristup razvoju distribuirane ve&scaron;tačke&nbsp; inteligencije. Ono &scaron;to agente izdvaja od ostalih pristupa su autonomno, reaktivino,&nbsp; pro-aktivno, i socijalno pona&scaron;anje. Pored toga, kompleksniji, inteligentni agenti se često defini&scaron;u koristeći ljudske mentalne konstrukcije, kao sto su verovanja, želje i namere.</p><p>Disertacija se bavi softverskim agentima i multiagentskim sistemima sa nekoliko aspekata. Prvo, definisana je nova&nbsp; arhitektura za rasuđivanje sa primenom u razvoju&nbsp; inteligentnih agenata, nazvana Distribuirani sistem za ne-aksiomatsko rasuđivanje&nbsp; (eng. <em>Distributed Non-Axiomatic Reasoning System</em>) (DNARS). Umesto popularnog&nbsp;&nbsp; BDI modela za razvoj inteligentnih agenata (eng. <em>Belief-Desire-Intention</em>),&nbsp; arhitektura&nbsp; se zasniva na tzv. <em>ne-aksiomatskoj</em> logici, formalizmu razvijenom u domenu ve&scaron;tačke&nbsp; op&scaron;te inteligencije. DNARS je skalabilan softverski sistem, sposoban da odgovara na&nbsp;&nbsp; pitanja i da izvodi nove zaključke na osnovu veoma velikih&nbsp; baza znanja, služeći pri&nbsp;&nbsp; tome veliki broj klijenata.</p><p>Zatim, u disertaciji je predložena nova multiagentska platforma nazvana Siebog. Siebog je zasnovan na modernim standardima za razvoj veb aplikacija, čime poku&scaron;ava da smanji razliku izmedu multiagentskih sistema i sistema koji se koriste u&nbsp;industriji. Kao DNARS, i Siebog je distribuiran sistem. Na serverskoj strani, Siebog se izvr&scaron;ava na računarskim klasterima, pružajući napredne funkcionalnosti, poput automatske distribucije agenata i otpornosti na gre&scaron;ke. Sa klijentske strane, Siebog&nbsp;se izvr&scaron;ava u veb pretrazivačima i podržava &scaron;iroku lepezu hardverskih i softverskih platformi.</p><p>Konačno, Siebog se oslanja na DNARS za ravoj agenata sa jedinstvenim sposobnostima za rasuđivanje.</p>

The purpose of information acquisition for data and information fusion is to provide relevant and timely information. The acquired information is integrated (or fused) to estimate the state of some environment. The success of information acquisition can be measured in the quality of the environment state estimates generated by the data and information fusion process. In this thesis, we introduce and set out to characterise the concept of large-scale information acquisition. Our interest in this subject is justified both by the identified lack of research on a holistic view on data and information fusion, and the proliferation of networked sensors which promises to enable handy access to a multitude of information sources. We identify a number of properties that could be considered in the context of large-scale information acquisition. The sensors used could be large in number, heterogeneous, complex, and distributed. Also, algorithms for large-scale information acquisition may have to deal with decentralised control and multiple and varying objectives. In the literature, a process that realises information acquisition is frequently denoted sensor management. We, however, introduce the term perception management instead, which encourages an agent perspective on information acquisition. Apart from explictly inviting the wealth of agent theory research into the data and information fusion research, it also highlights that the resource usage of perception management is constrained by the overall control of a system that uses data and information fusion. To address the challenges posed by the concept of large-scale information acquisition, we present a framework which highlights some of its pertinent aspects. We have implemented some important parts of the framework. What becomes evident in our study is the innate complexity of information acquisition for data and information fusion, which suggests approximative solutions. We, furthermore, study one of the possibly most important properties of large-scale information acquisition, decentralised control, in more detail. We propose a recurrent negotiation protocol for (decentralised) multi-agent coordination. Our approach to the negotiations is from an axiomatic bargaining theory perspective; an economics discipline. We identify shortcomings of the most commonly applied bargaining solution and demonstrate in simulations a problem instance where it is inferior to an alternative solution. However, we can not conclude that one of the solutions dominates the other in general. They are both preferable in different situations. We have also implemented the recurrent negotiation protocol on a group of mobile robots. We note some subtle difficulties with transferring bargaining solutions from economics to our computational problem. For instance, the characterising axioms of solutions in bargaining theory are useful to qualitatively compare different solutions, but care has to be taken when translating the solution to algorithms in computer science as some properties might be undesirable, unimportant or risk being lost in the translation. / QC 20100903

The axiomatic theory of ` Zelazko defines a variety of general spectra where specified axioms are satisfied. However, there arise a number of spectra, usually defined for a single element of a Banach algebra, that are not covered by the axiomatic theory of ` Zelazko. V. Kordula and V. M¨uller addressed this issue and created the theory of regularities. Their unique idea was to describe the underlying set of elements on which the spectrum is defined. The axioms of a regularity provide important consequences. We prove that the set of Koliha-Drazin invertible elements, which includes the Drazin invertible elements, forms a regularity. The properties of the spectrum corresponding to a regularity are also investigated. / Mathematical Sciences / M. Sc. (Mathematics)

Esta dissertação apresenta uma abordagem que aplica a Teoria de Projeto Axiomático à especificação de requisitos de sistemas de software visando melhorar a qualidade da solução de projeto desde a análise do problema até identificação dos requisitos efetivamente. O objetivo da abordagem desenvolvida é propor e integrar métodos que permitam o uso de Projeto Axiomático em um processo de Engenharia de Requisitos. A abordagem de especificação de requisitos proposta estabelece a aplicação do Axioma da Independência no estudo de problemas e necessidades do cliente. Desta forma, incluem-se no processo de engenharia de requisitos novos domínios de estudo, o domínio do problema e o domínio do cliente. É estabelecido um modelo de hierarquia para a decomposição de Problemas, Necessidades e Requisitos. Um processo de ziguezagueamento é sugerido para que se possa aplicar a abordagem proposta em conjunto com um processo de desenvolvimento interativo e incremental como o Processo Unificado. Apresenta-se um estudo de caso de um sistema de teste de equipamentos em uma linha de produção. O estudo de caso tem por objetivo demonstrar a aplicação prática da abordagem de especificação de requisitos proposta nesta dissertação. Além disso, apresentam-se os experimentos realizados durante o trabalho de pesquisa e seus resultados. Para exemplificar a execução dos experimentos é demonstrado o processo de especificação de requisitos para um sistema de relatórios de visitas a clientes. Este exemplo ajuda a ilustrar como a abordagem apresentada pode ser utilizada para aumentar a consistência e a qualidade dos requisitos de projetos de software. / This dissertation presents an approach that applies the Axiomatic Design Theory to the specification of software systems requirements. This Approach intends to improve the quality of design solution since its inception, which involves from the problem analysis to the requirements identification. The purpose of the proposed approach is to offer methods that allow the use of axiomatic design in a process of requirements engineering. The proposed requirements specification approach establishes the application of the Axiom of Independence in the study of problems and costumer needs. In this way, new domains, the problem domain and the costumer domain, are included in the requirements engineering process. It is established a hierarchical model for the decomposition of Problems, Needs and Requirements. A zig-zag process is suggested in order to use the propose approach in conjunction with a development process as the Unified Process. It is presented a case study of a system for equipment testing in a production line. The case study aims to demonstrate the practical application of the requirements specification approach proposed in this dissertation. In addition, the results of the experiments performed during the research are presented. The requirements specification process for a reporting system is shown to illustrate the experiments. This example helps billustrate how the proposed approach can be used to increase the consistency and quality of software requirements.

Esta dissertação apresenta uma abordagem que aplica a Teoria de Projeto Axiomático à especificação de requisitos de sistemas de software visando melhorar a qualidade da solução de projeto desde a análise do problema até identificação dos requisitos efetivamente. O objetivo da abordagem desenvolvida é propor e integrar métodos que permitam o uso de Projeto Axiomático em um processo de Engenharia de Requisitos. A abordagem de especificação de requisitos proposta estabelece a aplicação do Axioma da Independência no estudo de problemas e necessidades do cliente. Desta forma, incluem-se no processo de engenharia de requisitos novos domínios de estudo, o domínio do problema e o domínio do cliente. É estabelecido um modelo de hierarquia para a decomposição de Problemas, Necessidades e Requisitos. Um processo de ziguezagueamento é sugerido para que se possa aplicar a abordagem proposta em conjunto com um processo de desenvolvimento interativo e incremental como o Processo Unificado. Apresenta-se um estudo de caso de um sistema de teste de equipamentos em uma linha de produção. O estudo de caso tem por objetivo demonstrar a aplicação prática da abordagem de especificação de requisitos proposta nesta dissertação. Além disso, apresentam-se os experimentos realizados durante o trabalho de pesquisa e seus resultados. Para exemplificar a execução dos experimentos é demonstrado o processo de especificação de requisitos para um sistema de relatórios de visitas a clientes. Este exemplo ajuda a ilustrar como a abordagem apresentada pode ser utilizada para aumentar a consistência e a qualidade dos requisitos de projetos de software. / This dissertation presents an approach that applies the Axiomatic Design Theory to the specification of software systems requirements. This Approach intends to improve the quality of design solution since its inception, which involves from the problem analysis to the requirements identification. The purpose of the proposed approach is to offer methods that allow the use of axiomatic design in a process of requirements engineering. The proposed requirements specification approach establishes the application of the Axiom of Independence in the study of problems and costumer needs. In this way, new domains, the problem domain and the costumer domain, are included in the requirements engineering process. It is established a hierarchical model for the decomposition of Problems, Needs and Requirements. A zig-zag process is suggested in order to use the propose approach in conjunction with a development process as the Unified Process. It is presented a case study of a system for equipment testing in a production line. The case study aims to demonstrate the practical application of the requirements specification approach proposed in this dissertation. In addition, the results of the experiments performed during the research are presented. The requirements specification process for a reporting system is shown to illustrate the experiments. This example helps billustrate how the proposed approach can be used to increase the consistency and quality of software requirements.

L'objet de cette thèse est de proposer et de développer les différentes mesures multidimensionnelles de la pauvreté. La multidimensionnalité de la pauvreté fait aujourd'hui consensus. Scientifiques, décideurs politiques et professionnels du développement s'accordent pour dire que la seule dimension monétaire (le manque de revenu) ne suffit pas à représenter la pauvreté. En se basant sur les travaux de Sen (Prix Nobel d'Economie) en particulier sur l'approche des capacités, nous proposons quatre mesures différentes de la pauvreté. La première est une mesure monétaire basée sur l'approche utilitaire ; la seconde est une mesure subjective basée sur les expériences des ménages ; la troisième est une mesure multidimensionnelle axiomatique et enfin la dernière est une mesure non axiomatique basée sur la théorie des ensembles flous. Elles sont toutes mises en oeuvre en utilisant les données d'enquêtes EDAM3-IS (Enquête Djiboutienne Auprès des Ménages 2012). Les résultats s'inscrivent dans un contexte de croissance économique que connait Djibouti. Cependant, toutes les mesures utilisées ont montré des grandes disparités régionales entre la capitale et les régions en termes d'infrastructure de base et de bien-être des ménages. Chacune de ses méthodes a fourni des résultats avec différentes interprétations des déterminants de la pauvreté. Cela ne signifie pas qu'il existe une méthode bien meilleure que l'autre, mais chaque approche, dans un contexte particulier, peut-être plus pertinente. Ainsi, l'identification des pauvres en appliquant les différentes mesures de la pauvreté nous a donné un profil différencié. Par conséquent, le décideur doit définir au préalable l'objectif poursuivi dans les politiques de lutte contre la pauvreté. Nous pouvons souligner que l'intégration d'une pondération subjective dans la mesure de la pauvreté est une de nos contributions au développement de mesures multidimensionnelles de la pauvreté. / The aim of this thesis is to propose and develop the various multidimensional measures of poverty. There is a consensus on the multidimensional nature of poverty. Scientists, policy makers and development professionals agree that the monetary dimension (lack of income) is inadequate to represent poverty. On the basis of the work of Sen (Nobel Proze of Economics), particularly on the capability approach, we propose four different measures of poverty. The first one is a monetary measure based on the utilitarian approach ; the second is a subjective measure founded on household experience ; the third is a multidimensional axiomatic measure and the final one is a non-axiomatic measure based on the theory of fuzzy sets. They are implemented using survey data EDAM3-IS (Djiboutian Survey of Households 2012). The esults fall within the framework of economic growth in Djibouti. However, all the measures used have shown great disparities between the capital and the regions in terms of basic infrastructure and household welfare. Each method produced results with different interpretations of the determinants of poverty. This does not mean that there is one method being better than the other but rather each approach, in a particular context, may be more relevant. Thus, identifying the poor by applying the different measures of poverty gave us a clear-cut profile, which implies that the decision-maker must first set the aim in view in the implementation of anti-poverty policies. It can be emphasized that the inclusion of a subjective weighting in the process of measuring of poverty is one of our contributions towards the development of multidimensional measures of poverty.

La thèse propose quatre contributions sur la méthode axiomatique. Les trois premiers chapitres utilisent le formalisme des jeux coopératifs à utilité transférable. Dans les deux premiers chapitres, une étude systématique de l'opération de nullification est menée. Les axiomes de retraits sont transformés en axiomes de nullification. Des caractérisations existantes de règles d’allocation sont revisitées, et des résultats totalement neufs sont présentés. Le troisième chapitre introduit et caractérise une valeur de Shapley proportionnelle, où les dividendes d’Harsanyi sont partagés en proportion des capacités des singletons concernés. Le quatrième chapitre propose une variante multi-dimensionnelle de l’indice de Hirsch. Une caractérisation axiomatique et une application aux classements sportifs sont fournies. / The dissertation provides four contributions on the axiomatic method. The first three chapters deal with cooperative games with transferable utility. In the first two chapters, a systematic study of the nullification operation is done. The removal axioms are translated into their nullified counterparts. Some existing characterizations are revisited, and completely new results are presented. The third chapter introduces and characterizes a proportional Shapley value in which the Harsanyi dividends are shared in proportion to the stand-alone worths of the concerned players. The fourth chapter proposes a multi-dimensional variant of the Hirsch index. An axiomatic characterization and an application to sports rankings are provided.

Cette thèse traite de l’analyse théorique et l’application d’une nouvelle famille de jeux coopératifs, où la valeur de chaque coalition peut être calculée à partir des contributions des joueurs par un opérateur additif qui décrit comme les capacités individuelles interagissent au sein de groupes. Précisément, on introduit une grande classe de jeux, les Generalized Additive Games, qui embrasse plusieurs classes de jeux coopératifs dans la littérature, et en particulier de graph games, où un réseau décrit les restrictions des possibilités d’interaction entre les joueurs. Des propriétés et solutions pour cette classe de jeux sont étudiées, avec l’objectif de fournir des outils pour l’analyse de classes de jeux connues, ainsi que pour la construction de nouvelles classes de jeux avec des propriétés intéressantes d’un point de vue théorique. De plus, on introduit une classe de solutions pour les communication situations, où la formation d’un réseau est décrite par un mécanisme additif, et dans la dernière partie de cette thèse on présente des approches avec notre modèle à des problèmes réels modélisés par des graph games, dans les domaines de la théorie de l’argumentation et de la biomédecine. / This thesis deals with the theoretical analysis and the application of a new family of cooperative games, where the worth of each coalition can be computed from the contributions of single players via an additive operator describing how the individual abilities interact within groups. Specifically, we introduce a large class of games, namely the Generalized Additive Games, which encompasses several classes of cooperative games from the literature, and in particular of graph games, where a network describes the restriction of the interaction possibilities among players. Some properties and solutions of such class of games are studied, with the objective of providing useful tools for the analysis of known classes of games, as well as for the construction of new classes of games with interesting properties from a theoretic point of view. Moreover, we introduce a class of solution concepts for communication situations, where the formation of a network is described by means of an additive pattern, and in the last part of the thesis we present two approaches using our model to real-world problems described by graph games, in the fields of Argumentation Theory and Biomedicine.