Suchergebnisse

Abstract
Communication is an inherently strategic matter. This paper introduces simple game theoretic models of information transmission to identify different forms of uncertainty which may pose a problem of trust in testimony. Strategic analysis suggests discriminating between trust in integrity, trust in competence, trust in (the will to invest) effort and trust in honesty. Whereas uncertainty about the sender's honesty or integrity may directly influence a rational receiver's readiness to rely on sender's statements, neither uncertainty about the competence of a sender nor uncertainty about his willingness to invest effort has any direct impact on rational reliance on its own. In this regard, trust in honesty and trust in integrity appear to be more basic than trust in competence or effort.

Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper we present relational models of simple games and develop relational algorithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Algebra system RelView and, therefore, the system can be used to solve the problems and to visualize the results of the computations.

Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper we present relational models of simple games and develop relational algorithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Algebra system RelView and, therefore, the system can be used to solve the problems and to visualize the results of the computations.

International audience ; 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.