Computations on Simple Games using RelView
Abstract
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.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number hal-00633857.Length:
Date of creation: 2011
Date of revision:
Publication status: Published, Computer Algebra in Scientific Computing, Springer (Ed.), 2011, 49-60
Handle: RePEc:hal:cesptp:hal-00633857
Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00633857
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Related research
Keywords: relational algebra ; RelView ; simple games;This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-11-01 (All new papers)
- NEP-CMP-2011-11-01 (Computational Economics)
- NEP-GTH-2011-11-01 (Game Theory)
- NEP-HPE-2011-11-01 (History & Philosophy of Economics)
References
References listed on IDEASPlease 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)
hal-00574767, HAL.
- Berghammer, Rudolf & Bolus, Stefan & Rusinowska, Agnieszka & de Swart, Harrie, 2011. "A relation-algebraic approach to simple games," European Journal of Operational Research, Elsevier, vol. 210(1), pages 68-80, April.
- Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer, vol. 19(1), pages 1-9.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:hal-00633857For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.