Abstract
It is known that the lattice-minimal representation (by natural numbers) of a weighted majority game may be not unique and may lack of equal treatment (Isbell 1959). The same is true for the total-weight minimal representation. Both concepts coincide on the class of homogeneous games. The main theorem of this article is that for homogeneous games there is a unique minimal representation. This result is given by means of a construction that depends on the natural order on the set of player types. This order coincides with one induced by the “desirability relation”. In order to compute the minimal representation inductively, while proceeding from smaller players to the greater one, we are led to distinguish two different kinds of players: some players are “replacable” by smaller ones, some not.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.