On the use of binary decision diagrams for solving problems on simple games
暂无分享,去创建一个
[1] A. Deemen. Dominant players and minimum size coalitions , 1989 .
[2] On connected coalitions in dominated simple games , 1985 .
[3] Frank Neumann,et al. RelView - An OBDD-Based Computer Algebra System for Relations , 2005, CASC.
[4] Elchanan Mossel,et al. Sorting and Selection in Posets , 2007, SIAM J. Comput..
[5] B. Peleg,et al. Introduction to the Theory of Cooperative Games , 1983 .
[6] P. V. Roozendaal. Centre parties and coalition cabinet formations: a game theoretic approach , 1990 .
[7] Josep Freixas,et al. On the existence of a minimum integer representation for weighted voting systems , 2009, Ann. Oper. Res..
[8] Harrie C. M. de Swart,et al. Applying relational algebra and Rel , 2007, Eur. J. Oper. Res..
[9] Beate Bollig,et al. Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.
[10] Josep Freixas,et al. Complete simple games , 1996 .
[11] Trilochan Sastry,et al. Easy weighted majority games , 2000, Math. Soc. Sci..
[12] B. Peleg. Coalition formation in simple games with dominant players , 1981 .
[13] Alan D. Taylor. Mathematics And Politics , 1995 .
[14] Taylor Alan,et al. Weighted Voting, Multicameral Representation, and Power , 1993 .
[15] A. M. A. van Deemen,et al. Coalition Formation in Centralized Policy Games , 1991 .
[16] I. Wegener. Branching Programs and Binary Deci-sion Diagrams-Theory and Applications , 1987 .
[17] P. V. Roozendaal. Cabinets in the Netherlands (1918–1990): The importance of ‘dominant’ and ‘central’ parties , 1993 .
[18] Chen-Shang Lin,et al. On the OBDD-Representation of General Boolean Functions , 1992, IEEE Trans. Computers.
[19] Dan S. Felsenthal,et al. The Treaty of Nice and qualified majority voting , 2001, Soc. Choice Welf..
[20] T. Matsui,et al. A SURVEY OF ALGORITHMS FOR CALCULATING POWER INDICES OF WEIGHTED MAJORITY GAMES , 2000 .
[21] Luigi Palopoli,et al. On the complexity of core, kernel, and bargaining set , 2008, Artif. Intell..
[22] Michael Wooldridge,et al. On the computational complexity of weighted voting games , 2009, Annals of Mathematics and Artificial Intelligence.
[23] Forming Coalitions and Measuring Voting Power , 1982 .
[24] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[25] J. R. Isbell,et al. A class of simple games , 1958 .
[26] Josep Freixas,et al. The dimension for the European Union Council under the Nice rules , 2004, Eur. J. Oper. Res..
[27] Gunther Schmidt,et al. Relational Mathematics , 2010, Encyclopedia of Mathematics and its Applications.
[28] Harrie C. M. de Swart,et al. An interdisciplinary approach to coalition formation , 2009, Eur. J. Oper. Res..
[29] Ingo Wegener. The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions , 1994, IEEE Trans. Computers.
[30] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[31] J. Deegan,et al. A new index of power for simplen-person games , 1978 .
[32] Stefan Bolus,et al. Power indices of simple games and vector-weighted majority games by means of binary decision diagrams , 2011, Eur. J. Oper. Res..
[33] Jerry S. Kelly,et al. NP-completeness of some problems concerning voting games , 1990 .
[34] Rudolf Berghammer,et al. Implementation of Relational Algebra Using Binary Decision Diagrams , 2001, RelMiCS.
[35] Josep Freixas,et al. A new power index based on minimal winning coalitions without any surplus , 2010, Decis. Support Syst..
[36] J. Neumann,et al. Theory of Games and Economic Behavior. , 1945 .
[37] F. Carreras. Protectionism and blocking power indices , 2009 .
[38] Gerhard J. Woeginger,et al. Faster algorithms for computing power indices in weighted voting games , 2005, Math. Soc. Sci..
[39] Harrie C. M. de Swart,et al. Computational Social Choice Using Relation Algebra and RelView , 2009, RelMiCS.