On the use of binary decision diagrams for solving problems on simple games
AbstractSimple games are yes/no cooperative games which arise in many practical applications. Recently, we have used reduced ordered binary decision diagrams and quasi-reduced ordered binary decision diagrams (abbreviated as Robdds and Qobdds, respectively) for the representation of simple games and for the computation of some power indices. In the present paper, we continue this work. We show how further important computational problems on simple games can be solved using Qobdds, viz. the identification of some key players, the computation of the desirability relation on individuals, the test whether a simple game is proper and strong, respectively, and the computation of Qobdd-representations for the sets of all minimal winning coalitions, all shift-minimal winning coalitions and all blocking coalitions, respectively. Applications of these solutions include the computation of recent power indices based on shift-minimal winning coalitions and the test for linear separability of a directed simple game.
Download InfoIf 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 222 (2012)
Issue (Month): 3 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Binary decision diagrams; Simple games; Key players; Desirability relation; Blocking coalition; Shift-minimal winning coalition;
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.:
- Bolus, Stefan, 2011. "Power indices of simple games and vector-weighted majority games by means of binary decision diagrams," European Journal of Operational Research, Elsevier, vol. 210(2), pages 258-272, April.
- Francesc Carreras, 2009. "Protectionism and blocking power indices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 17(1), pages 70-84, July.
- 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.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie De Swart, 2009. "An Interdisciplinary Approach to Coalition Formation," Post-Print halshs-00406460, HAL.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2009.
"Applying Relation Algebra and RelView to Measures in a Social Network,"
0902, Groupe d'Analyse et de Théorie Economique (GATE), Centre national de la recherche scientifique (CNRS), Université Lyon 2, Ecole Normale Supérieure.
- Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2010. "Applying relation algebra and RelView to measures in a social network," European Journal of Operational Research, Elsevier, vol. 202(1), pages 182-195, April.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie De Swart, 2009. "Applying Relation Algebra and RelView to Measures in aSocial Network," Post-Print halshs-00355699, HAL.
- 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.
- Carreras, Francesc & Freixas, Josep, 1996. "Complete simple games," Mathematical Social Sciences, Elsevier, vol. 32(2), pages 139-155, October.
- Klinz, Bettina & Woeginger, Gerhard J., 2005. "Faster algorithms for computing power indices in weighted voting games," Mathematical Social Sciences, Elsevier, vol. 49(1), pages 111-116, January.
- Freixas, J., 2004. "The dimension for the European Union Council under the Nice rules," European Journal of Operational Research, Elsevier, vol. 156(2), pages 415-419, July.
- 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.
- Moshé Machover & Dan S. Felsenthal, 2001. "The Treaty of Nice and qualified majority voting," Social Choice and Welfare, Springer, vol. 18(3), pages 431-464.
- Chakravarty, Nilotpal & Goel, Anand Mohan & Sastry, Trilochan, 2000. "Easy weighted majority games," Mathematical Social Sciences, Elsevier, vol. 40(2), pages 227-235, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.