Computations on Simple Games using REL VIEW
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. As an example, we consider the German parliament after the 2009 election.
|Date of creation:||Mar 2011|
|Date of revision:|
|Contact details of provider:|| Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13|
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rudolf Berghammer & Stefan Bolus & Agnieszka Rusinowska & Harrie De Swart, 2011.
"A relation-algebraic approach to simple games,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie De Swart, 2009.
"An Interdisciplinary Approach to Coalition Formation,"
- Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2009. "An interdisciplinary approach to coalition formation," European Journal of Operational Research, Elsevier, vol. 195(2), pages 487-496, June.
- A. M. A. van Deemen, 1991. "Coalition Formation in Centralized Policy Games," Journal of Theoretical Politics, SAGE Publishing, vol. 3(2), pages 139-161, April.
- Rudolf Berghammer & Harrie De Swart & Agnieszka Rusinowska, 2007.
"Applying relational algebra and RelView to coalition formation,"
- Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2007. "Applying relational algebra and RelView to coalition formation," European Journal of Operational Research, Elsevier, vol. 178(2), pages 530-542, April.
- Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(1), pages 1-9.
When requesting a correction, please mention this item's handle: RePEc:mse:cesdoc:11014. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label)
If references are entirely missing, you can add them using this form.