Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Hierarchies achievable in simple games

Autor
Freixas, J.; Pons, M.
Tipus d'activitat
Article en revista
Revista
Theory and decision
Data de publicació
2010-04
Volum
68
Número
4
Pàgina inicial
393
Pàgina final
404
DOI
https://doi.org/10.1007/s11238-008-9108-0 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/7326 Obrir en finestra nova
Resum
A previous work by Friedman et al. (Theory and Decision, 61:305–318, 2006) introduces the concept of a hierarchy of a simple voting game and characterizes which hierarchies, induced by the desirability relation, are achievable in linear games. In this paper, we consider the problem of determining all hierarchies, conserving the ordinal equivalence between the Shapley–Shubik and the Penrose–Banzhaf–Coleman power indices, achievable in simple games. It is proved that only four hierarchies ...
Citació
Freixas, J.; Pons, M. Hierarchies achievable in simple games. "Theory and decision", Abril 2010, vol. 68, núm. 4, p. 393-404.
Grup de recerca
GRTJ - Grup de Recerca en Teoria de Jocs

Participants