GDL

Journal from gdlhub / 2017-08-14 11:57:17
Oleh : E. Algaba, J.M. Bilbao, JR Fernandez Garcia, JJ Lopez, ELSEVIER
Dibuat : 2010-08-26, dengan 1 file

Keyword : Computing, power,indices, weighted, multiple, majority, games

The Shapley–Shubik power index in a voting situation depends on the number of orderings in which each player is pivotal. The Banzhaf power index depends on the number of ways in which each voter can effect a swing. If the input size of the problem is n, then the function which measures the worst case running time for computing these indices is in Osn2 d. We present a method based on generating functions to compute these power indices efficiently for weighted multiple majority games and we study the temporal complexity of the algorithms. Finally, we apply the algorithms obtained with this method to compute the Banzhaf and the Shapley–Shubik indices under the two decision rules adopted in the Nice European Union summit.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	ELSEVIER
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com