24 research outputs found
Applying relational algebra and RelView to coalition formation
We present an application of relational algebra to coalition formation. This leads to specifications, which can be executed with the help of the RelView tool after a simple translation into the tool's programming language. As an example we consider a simplification of the situation in Poland after the 2001 elections.RelView; relational algebra; coalition formation; feasible government; dominance; stable government
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision - making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them. In particular, we test certain fundamental properties of simple games and compute specific players and coalitions. We also apply relation algebra to determine power indices. This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool RelView after a simple translation into the tool's programming language. In order to demonstrate the visualization facilities of RelView, we consider an example of the Catalonian Parliament after the 2003 election.Relation algebra ; RelView ; simple game ; winning coalition ; swinger ; dominant player ; central player ; power index
Applications of Relations and Graphs to Coalition Formation
A stable government is by definition not dominated by any other government. However, it may happen that all governments are dominated. In graph-theoretic terms this means that the dominance graph does not possess a source. In this paper we are able to deal with this case by a clever combination of notions from different fields, such as relational algebra, graph theory, social choice and bargaining theory, and by using the computer support system RelView for computing solutions and visualizing the results. Using relational algorithms, in such a case we break all cycles in each initial strongly connected component by removing the vertices in an appropriate minimum feedback vertex set. So, we can choose an un-dominated government. To achieve unique solutions, we additionally apply social choice rules. The main parts of our procedure can be executed using the RelView tool. Its sophisticated implementation of relations allows to deal with graph sizes that are sufficient for practical applications of coalition formation.Graph Theory, RELVIEW, Relational Algebra, Dominance, Stable Government
Applying Relation Algebra and RelView to Measures in aSocial Network
We present an application of relation algebra to measure players' ‘strength' in a social network with influence between players. In particular, we deal with power, success, and influence of a player as measured by the Hoede-Bakker index, its generalization and modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influence function. This leads to specifications, which can be executed with the help of the BDDbased tool RelView after a simple translation into the tool's programming language. As an example we consider the present Dutch parliament.RelView ; relation algebra ; social network ; the Hoede-Bakker index ; influence index ;follower ; kernel
Applying relational algebra and RelView to measures in a social network
We present an application of relation algebra to measure agents' 'strength' in a social network with influence between agents. In particular, we deal with power, success, and influence of an agent as measured by the generalized Hoede-Bakker index and its modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influence function. This leads to specifications, which can be executed with the help of the BDD-based tool RelView after a simple translation into the tool's programming language. As an example we consider the present Dutch parliament.RelView; relation algebra; social network; Hoede-Bakker index; influence index
Social networks: Prestige, centrality, and influence (Invited paper)
We deliver a short overview of di erent centrality measures and influence concepts in social networks, and present the relation-algebraic approach to the concepts of power and influence. First, we briefly discuss four kinds of measures of centrality: the ones based on degree, closeness, betweenness, and the eigenvector-related measures. We consider centrality of a node and of a network. Moreover, we give a classi cation of the centrality measures based on a topology of network flows. Furthermore, we present a certain model of influence in a social network and discuss some applications of relation algebra and RelView to this model.social network ; centrality ; prestige ; influence ; relation algebra ; RelView
A relation-algebraic approach to simple games
International audienceSimple games are a powerful tool to analyze decision - making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems of them. In particular, we test certain fundamental properties of simple games and compute specific players and coalitions. We also apply relation algebra to determine power indices. This leads to relation-algebraic specifications, which can be evaluated with the help of the BDD-based tool RelView after a simple translation into the tool's programming language. In order to demonstrate the visualization facilities of RelView, we consider an example of the Catalonian Parliament after the 2003 election
Social networks: Prestige, centrality, and influence (Invited paper)
We deliver a short overview of di erent centrality measures and influence concepts in social networks, and present the relation-algebraic approach to the concepts of power and influence. First, we briefly discuss four kinds of measures of centrality: the ones based on degree, closeness, betweenness, and the eigenvector-related measures. We consider centrality of a node and of a network. Moreover, we give a classi cation of the centrality measures based on a topology of network flows. Furthermore, we present a certain model of influence in a social network and discuss some applications of relation algebra and RelView to this model
Relation-algebraic specification and solution of special university timetabling problems
AbstractIn this paper, we are concerned with a special timetabling problem. It was posed to us by the administration of our university and stems from the adoption of the British-American system of university education in Germany. This change led to the concrete task of constructing a timetable that enables the undergraduate education of secondary school teachers within three years in the “normal case” and within four years in the case of exceptional combinations of subjects. We develop two relation-algebraic models of the timetabling problem and in each case algorithms for computing solutions. The latter easily can be implemented in the Kiel RelView tool showing that RelView can be used for timetabling